Search results for "approksimointi"

showing 10 items of 38 documents

How much is enough? : The convergence of finite sample scattering properties to those of infinite media

2021

We study the scattering properties of a cloud of particles. The particles are spherical, close to the incident wavelength in size, have a high albedo, and are randomly packed to 20% volume density. We show, using both numerically exact methods for solving the Maxwell equations and radiative-transfer-approximation methods, that the scattering properties of the cloud converge after about ten million particles in the system. After that, the backward-scattered properties of the system should estimate the properties of a macroscopic, practically infinite system. (C) 2021 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.o…

010504 meteorology & atmospheric scienceseducationparticulate random mediapienhiukkasetoptiset ominaisuudet01 natural sciences114 Physical sciencesVolume densityScatteringsymbols.namesakelaskennallinen tiedeConvergence (routing)Radiative transferRadiative transferMaxwellin yhtälötsirontaSpectroscopy0105 earth and related environmental sciencesPhysicsRadiationScatteringscatteringAlbedoSample (graphics)Atomic and Molecular Physics and OpticsComputational physicsWavelengthMaxwell's equationsMaxwell equationsradiative transferParticulate random mediasymbolsapproksimointi
researchProduct

Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?

2020

Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem. Several different solvers can be applied to the resulting linear problem. In this paper, a thorough comparison of possible and recently proposed, especially randomized, algorithms is carried out for this problem with a representative set of regression datasets. In addition, we compare MLM with shallow and deep feedforward neural network models and study the effects of the number of observations and the number of features with a special dat…

0209 industrial biotechnologyrandom projectionlcsh:Computer engineering. Computer hardwareComputational complexity theoryComputer scienceRandom projectionlcsh:TK7885-789502 engineering and technologyMachine learningcomputer.software_genresupervised learningapproximate algorithmsSet (abstract data type)regressioanalyysi020901 industrial engineering & automationdistance–based regressionalgoritmit0202 electrical engineering electronic engineering information engineeringordinary least–squaresbusiness.industrySupervised learningsingular value decompositionminimal learning machineMultilaterationprojektioRandomized algorithmkoneoppiminenmachine learningScalabilityFeedforward neural network020201 artificial intelligence & image processingArtificial intelligenceapproksimointibusinesscomputerMachine Learning and Knowledge Extraction
researchProduct

The Calderón problem for the fractional Schrödinger equation

2020

We show global uniqueness in an inverse problem for the fractional Schr\"odinger equation: an unknown potential in a bounded domain is uniquely determined by exterior measurements of solutions. We also show global uniqueness in the partial data problem where the measurements are taken in arbitrary open, possibly disjoint, subsets of the exterior. The results apply in any dimension $\geq 2$ and are based on a strong approximation property of the fractional equation that extends earlier work. This special feature of the nonlocal equation renders the analysis of related inverse problems radically different from the traditional Calder\'on problem.

Approximation propertyDimension (graph theory)35J10Disjoint sets01 natural sciences35J70Domain (mathematical analysis)inversio-ongelmatSchrödinger equationsymbols.namesakeMathematics - Analysis of PDEs0103 physical sciencesApplied mathematicsUniqueness0101 mathematicsMathematicsosittaisdifferentiaaliyhtälötNumerical AnalysisCalderón problemApplied Mathematics010102 general mathematicsInverse problem35R30approximation propertyBounded functionsymbolsinverse problem010307 mathematical physicsfractional Laplacianapproksimointi26A33Analysis
researchProduct

Many-body Green's function theory of electrons and nuclei beyond the Born-Oppenheimer approximation

2020

The method of many-body Green's functions is developed for arbitrary systems of electrons and nuclei starting from the full (beyond Born-Oppenheimer) Hamiltonian of Coulomb interactions and kinetic energies. The theory presented here resolves the problems arising from the translational and rotational invariance of this Hamiltonian that afflict the existing many-body Green's function theories. We derive a coupled set of exact equations for the electronic and nuclear Green's functions and provide a systematic way to approximately compute the properties of arbitrary many-body systems of electrons and nuclei beyond the Born-Oppenheimer approximation. The case of crystalline solids is discussed …

Born–Oppenheimer approximationFOS: Physical sciences02 engineering and technologyElectronKinetic energy01 natural sciencesMany bodytiiviin aineen fysiikkaGreen's function methodssymbols.namesake0103 physical sciencesCoulombkvanttifysiikka010306 general physicsPhysicsQuantum PhysicsExact differential equation021001 nanoscience & nanotechnologyMany-body techniquesCondensed Matter - Other Condensed MatterClassical mechanicssymbolsRotational invarianceCrystalline systemsapproksimointiQuantum Physics (quant-ph)0210 nano-technologyHamiltonian (quantum mechanics)Other Condensed Matter (cond-mat.other)
researchProduct

Approximation of functions over manifolds : A Moving Least-Squares approach

2021

We present an algorithm for approximating a function defined over a $d$-dimensional manifold utilizing only noisy function values at locations sampled from the manifold with noise. To produce the approximation we do not require any knowledge regarding the manifold other than its dimension $d$. We use the Manifold Moving Least-Squares approach of (Sober and Levin 2016) to reconstruct the atlas of charts and the approximation is built on-top of those charts. The resulting approximant is shown to be a function defined over a neighborhood of a manifold, approximating the originally sampled manifold. In other words, given a new point, located near the manifold, the approximation can be evaluated…

Computational Geometry (cs.CG)FOS: Computer and information sciencesComputer Science - Machine LearningClosed manifolddimension reductionMachine Learning (stat.ML)010103 numerical & computational mathematicsComplex dimensionTopology01 natural sciencesMachine Learning (cs.LG)Volume formComputer Science - GraphicsStatistics - Machine Learningmanifold learningApplied mathematics0101 mathematicsfunktiotMathematicsManifold alignmentAtlas (topology)Applied Mathematicshigh dimensional approximationManifoldGraphics (cs.GR)Statistical manifold010101 applied mathematicsregression over manifoldsComputational Mathematicsout-of-sample extensionComputer Science - Computational Geometrynumeerinen analyysimonistotapproksimointimoving least-squaresCenter manifold
researchProduct

Guaranteed and computable error bounds for approximations constructed by an iterative decoupling of the Biot problem

2021

The paper is concerned with guaranteed a posteriori error estimates for a class of evolutionary problems related to poroelastic media governed by the quasi-static linear Biot equations. The system is decoupled by employing the fixed-stress split scheme, which leads to an iteratively solved semi-discrete system. The error bounds are derived by combining a posteriori estimates for contractive mappings with functional type error control for elliptic partial differential equations. The estimates are applicable to any approximation in the admissible functional space and are independent of the discretization method. They are fully computable, do not contain mesh-dependent constants, and provide r…

DiscretizationPoromechanics010103 numerical & computational mathematicsContraction mappings01 natural sciencesFOS: MathematicsDecoupling (probability)Applied mathematicsMathematics - Numerical Analysis0101 mathematicsvirheanalyysiMathematicsa posteriori error estimatesosittaisdifferentiaaliyhtälötA posteriori error estimatesfixed-stress split iterative schemeBiot numberNumerical Analysis (math.NA)Biot problem010101 applied mathematicsComputational MathematicsBiot problem; Fixed-stress split iterative scheme; A posteriori error estimates; Contraction mappingsComputational Theory and MathematicsElliptic partial differential equationModeling and SimulationNorm (mathematics)contraction mappingsA priori and a posterioriFixed-stress split iterative schemenumeerinen analyysiapproksimointiError detection and correction
researchProduct

Minimal Learning Machine: Theoretical Results and Clustering-Based Reference Point Selection

2019

The Minimal Learning Machine (MLM) is a nonlinear supervised approach based on learning a linear mapping between distance matrices computed in the input and output data spaces, where distances are calculated using a subset of points called reference points. Its simple formulation has attracted several recent works on extensions and applications. In this paper, we aim to address some open questions related to the MLM. First, we detail theoretical aspects that assure the interpolation and universal approximation capabilities of the MLM, which were previously only empirically verified. Second, we identify the task of selecting reference points as having major importance for the MLM's generaliz…

FOS: Computer and information sciencesComputer Science - Machine LearningMinimal Learning MachinekoneoppiminenStatistics - Machine Learninguniversal approximationMachine Learning (stat.ML)interpolointiapproksimointireference point selectionclusteringMachine Learning (cs.LG)
researchProduct

Approximate energy functionals for one-body reduced density matrix functional theory from many-body perturbation theory

2018

We develop a systematic approach to construct energy functionals of the one-particle reduced density matrix (1RDM) for equilibrium systems at finite temperature. The starting point of our formulation is the grand potential $\Omega [\mathbf{G}]$ regarded as variational functional of the Green's function $G$ based on diagrammatic many-body perturbation theory and for which we consider either the Klein or Luttinger-Ward form. By restricting the input Green's function to be one-to-one related to a set on one-particle reduced density matrices (1RDM) this functional becomes a functional of the 1RDM. To establish the one-to-one mapping we use that, at any finite temperature and for a given 1RDM $\…

Grand potentialSolid-state physicsComplex systemFOS: Physical sciencesdensity matrix functional theory01 natural sciencesCondensed Matter - Strongly Correlated Electronssymbols.namesakePhysics - Chemical Physics0103 physical sciencesSDG 7 - Affordable and Clean Energy010306 general physicsMathematical physicsEnergy functionalChemical Physics (physics.chem-ph)PhysicsQuantum Physics/dk/atira/pure/sustainabledevelopmentgoals/affordable_and_clean_energyStrongly Correlated Electrons (cond-mat.str-el)010304 chemical physicstiheysfunktionaaliteoriamany-body perturbation theory16. Peace & justiceCondensed Matter PhysicsStationary pointElectronic Optical and Magnetic MaterialsCondensed Matter - Other Condensed Matterapproximate energy functionalssymbolsReduced density matrixapproksimointiQuantum Physics (quant-ph)Hamiltonian (quantum mechanics)Ground stateOther Condensed Matter (cond-mat.other)The European Physical Journal B
researchProduct

PAINT : Pareto front interpolation for nonlinear multiobjective optimization

2011

A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method implies a mixed integer linear surrogate problem for the original problem which can be optimized with any interactive method to make decisions concerning the original problem. When the scalarizations of the interactive method used do not introduce nonlinearity to the problem (which is true e.g., for the synchronous NIMBUS method), the scalarizations of the surrogate problem can be optimized with available mixed integer linear solvers. Thus, the use of the interactive meth…

Pareto optimalityMathematical optimizationMatematikControl and OptimizationApplied MathematicsComputationally expensive problemsMulti-objective optimizationmonitavoiteoptimointiSet (abstract data type)Computational MathematicsPareto optimalNonlinear systemMultiobjective optimization problemapproksimaatioPareto-optimaalisuusapproksimointiAlgorithmApproximationMathematicsInterpolationMathematicsInteger (computer science)Multiobjective optimizationInteractive decision making
researchProduct

Approximation method for computationally expensive nonconvex multiobjective optimization problems

2012

Pareto-tehokkuusPareto optimalitycomputational efficiencyPareto front approximationpäätöksentekodecision makerpsychological convergencemonitavoiteoptimointilaskennallinen vaativuussurrogate functioninteractive decision makingmenetelmätPareto-optimointioptimointilaskennalliset menetelmätmultiobjective optimizationPareto dominancyapproksimointicomputational cost
researchProduct