Algorithms for Numerical Analysis in High Dimensions

DOI10.1137/040604959zbMath1085.65045OpenAlexW2073469810MaRDI QIDQ5693182

Gregory Beylkin, Martin J. Mohlenkamp

Publication date: 22 September 2005

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040604959

zbMATH Keywords

computational complexitycurse of dimensionalityseparation of variablesalternating least squaresseparated representationantisymmetric functionsmultidimensional operatormultidimensional functionmultiparticle Schrödinger equationalgorithms in high dimensionsseparated solutions of linear systemsseparation-rank reduction

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Iterative numerical methods for linear systems (65F10) Algorithms for approximation of functions (65D15) Applications to the sciences (65Z05) Complexity and performance of numerical algorithms (65Y20)

Related Items (only showing first 100 items - show all)

Tensor decomposition and high-performance computing for solving high-dimensional stochastic control system numerically ⋮ Numerical solution of high dimensional stationary Fokker-Planck equations via tensor decomposition and Chebyshev spectral differentiation ⋮ Uncertainty propagation in orbital mechanics via tensor decomposition ⋮ Proper generalized decomposition of multiscale models ⋮ Weak SINDy for partial differential equations ⋮ Proper generalized decomposition of time-multiscale models ⋮ Tensor decomposition in electronic structure calculations on 3D Cartesian grids ⋮ On the fast computation of high dimensional volume potentials ⋮ On the spectral problem for trivariate functions ⋮ Alleviating mesh constraints: model reduction, parallel time integration and high resolution homogenization ⋮ A low-rank approach to the computation of path integrals ⋮ Numerical methods for high-dimensional probability density function equations ⋮ Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format ⋮ Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ Black box low tensor-rank approximation using fiber-crosses ⋮ Multiresolution separated representations of singular and weakly singular operators ⋮ Tensor Completion in Hierarchical Tensor Representations ⋮ Approximation of solutions to multidimensional parabolic equations by approximate approximations ⋮ SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains ⋮ Wave atoms and time upscaling of wave equations ⋮ A projection method and Kronecker product preconditioner for solving Sylvester tensor equations ⋮ Iterative methods for computing vibrational spectra ⋮ Low-rank separated representation surrogates of high-dimensional stochastic functions: application in Bayesian inference ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Recent advances and new challenges in the use of the proper generalized decomposition for solving multidimensional models ⋮ Proper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problems ⋮ On the convergence of a greedy rank-one update algorithm for a class of linear systems ⋮ Solving coupled tensor equations via higher order LSQR methods ⋮ Iterative methods based on soft thresholding of hierarchical tensors ⋮ Orbit uncertainty propagation and sensitivity analysis with separated representations ⋮ Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument ⋮ Some convergence results on the regularized alternating least-squares method for tensor decomposition ⋮ Musings on multilinear fitting ⋮ On the deterministic solution of multidimensional parametric models using the proper generalized decomposition ⋮ A tensor decomposition approach to data compression and approximation of ND systems ⋮ Variational calculus with sums of elementary tensors of fixed rank ⋮ A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format ⋮ Adaptive near-optimal rank tensor approximation for high-dimensional operator equations ⋮ Model's sparse representation based on reduced mixed GMsFE basis methods ⋮ Constructive representation of functions in low-rank tensor formats ⋮ Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation ⋮ Fast adaptive algorithms in the non-standard form for multidimensional problems ⋮ Optimization via separated representations and the canonical tensor decomposition ⋮ Optimization problems in contracted tensor networks ⋮ Non-incremental boundary element discretization of parabolic models based on the use of the proper generalized decompositions ⋮ Tensor approximation of the self-diffusion matrix of tagged particle processes ⋮ Multiresolution representation of operators with boundary conditions on simple domains ⋮ Polynomial Approximation of High-Dimensional Hamilton--Jacobi--Bellman Equations and Applications to Feedback Control of Semilinear Parabolic PDEs ⋮ Structured Matrix Problems from Tensors ⋮ High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic ⋮ Reduction of multivariate mixtures and its applications ⋮ Ideal minimal residual-based proper generalized decomposition for non-symmetric multi-field models -- application to transient elastodynamics in space-time domain ⋮ Partitioned treatment of uncertainty in coupled domain problems: a separated representation approach ⋮ Numerically explicit potentials for the homogenization of nonlinear elastic heterogeneous materials ⋮ Space-time proper generalized decompositions for the resolution of transient elastodynamic models ⋮ Fast computation of elastic and hydrodynamic potentials using approximate approximations ⋮ Non-intrusive low-rank separated approximation of high-dimensional stochastic models ⋮ Sparse Grid Combination Technique for Hagan SABR/LIBOR Market Model ⋮ Approximate iterations for structured matrices ⋮ A priori model reduction through proper generalized decomposition for solving time-dependent partial differential equations ⋮ A fast solution method for time dependent multidimensional Schrödinger equations ⋮ Approximating a wavefunction as an unconstrained sum of Slater determinants ⋮ PDE formulation of some SABR/LIBOR market models and its numerical solution with a sparse grid combination technique ⋮ Greedy algorithms for high-dimensional eigenvalue problems ⋮ Towards a 2.5D geometric model in mold filling simulation ⋮ Jacobi--Davidson Method on Low-Rank Matrix Manifolds ⋮ Tensor-product approximation to operators and functions in high dimensions ⋮ Weighted Moore-Penrose inverses of arbitrary-order tensors ⋮ Fast algorithms for Helmholtz Green's functions ⋮ Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations ⋮ Use of tensor formats in elliptic eigenvalue problems ⋮ Towards tensor-based methods for the numerical approximation of the Perron-Frobenius and Koopman operator ⋮ Fast cubature of volume potentials over rectangular domains by approximate approximations ⋮ On approximation of functions by exponential sums ⋮ On reverse-order law of tensors and its application to additive results on Moore-Penrose inverse ⋮ Wave propagation using bases for bandlimited functions ⋮ \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ Circumventing Curse of Dimensionality in the Solution of Highly Multidimensional Models Encountered in Quantum Mechanics Using Meshfree Finite Sums Decomposition ⋮ Numerical tensor calculus ⋮ Fast cubature of high dimensional biharmonic potential based on approximate approximations ⋮ Adaptive Low-Rank Methods: Problems on Sobolev Spaces ⋮ TT-cross approximation for multidimensional arrays ⋮ Randomized interpolative decomposition of separated representations ⋮ A numerical solver for high dimensional transient Fokker-Planck equation in modeling polymeric fluids ⋮ Reverse-order law for weighted Moore-Penrose inverse of tensors ⋮ Integration by interpolation and look-up for Galerkin-based isogeometric analysis ⋮ Modified iterations for data-sparse solution of linear systems ⋮ Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme ⋮ Stochastic boundary methods of fundamental solutions for solving PDEs ⋮ The Random Feature Model for Input-Output Maps between Banach Spaces ⋮ Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data ⋮ Generic and typical ranks of multi-way arrays ⋮ A least-squares approximation of partial differential equations with high-dimensional random inputs ⋮ Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side ⋮ Tensor representation of non-linear models using cross approximations ⋮ A literature survey of low-rank tensor approximation techniques ⋮ Low-CP-rank tensor completion via practical regularization ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

This page was built for publication: Algorithms for Numerical Analysis in High Dimensions