Algorithms for Numerical Analysis in High Dimensions

Nearly every numerical analysis algorithm has computational complexity that scales exponentially in the underlying physical dimension. The separated representation, introduced previously, allows many operations to be performed with scaling that is formally linear in the dimension. In this paper we f...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:SIAM journal on scientific computing Ročník 26; číslo 6; s. 2133 - 2159
Hlavní autori: Beylkin, Gregory, Mohlenkamp, Martin J.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2005
Predmet:
Accuracy
Algorithms
Applied mathematics
Approximations and expansions
Engineering Sciences
Euclidean space
Exact sciences and technology
Linear algebra
Mathematical analysis
Mathematics
Mechanics
Methods of scientific computing (including symbolic computation, algebraic computation)
Numerical analysis
Numerical analysis. Scientific computation
Numerical approximation
Quantum physics
Sciences and techniques of general use
Structural mechanics
separation-rank reduction
separated representation
Direct method
Separation method
65Z05
Least squares method
41A63
Algorithm complexity
Multidimensional operator
41A29
Dimensionality
multiparticle Schrödinger equation
curse of dimensionality
Numerical linear algebra
Antisymmetric function
separated solutions of linear systems
65Y20
antisymmetric functions 65D15
Schrödinger equation
81-08
alternating least squares
Numerical analysis
Linear system
Scientific computation
Multidimensional space
Matrix inversion
Quantum mechanics
Multidimensional function
Condition number
algorithms in high dimensions
separation of variables
Algorithm analysis
multidimensional function
antisymmetric functions
multidimensional operator
ISSN:1064-8275, 1095-7197
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Nearly every numerical analysis algorithm has computational complexity that scales exponentially in the underlying physical dimension. The separated representation, introduced previously, allows many operations to be performed with scaling that is formally linear in the dimension. In this paper we further develop this representation by (i) discussing the variety of mechanisms that allow it to be surprisingly efficient; (ii) addressing the issue of conditioning; (iii) presenting algorithms for solving linear systems within this framework; and (iv) demonstrating methods for dealing with antisymmetric functions, as arise in the multiparticle Schrodinger equation in quantum mechanics. Numerical examples are given.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:1064-8275
1095-7197
DOI:10.1137/040604959