Algorithms for Numerical Analysis in High Dimensions
From MaRDI portal
Publication:5693182
DOI10.1137/040604959zbMATH Open1085.65045OpenAlexW2073469810MaRDI QIDQ5693182FDOQ5693182
Authors: 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
Recommendations
computational complexityalternating least squarescurse of dimensionalityseparation of variablesseparated representationantisymmetric functionsmultidimensional operatormultidimensional functionmultiparticle Schrödinger equationalgorithms in high dimensionsseparated solutions of linear systemsseparation-rank reduction
Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10) General theory of numerical analysis in abstract spaces (65J05) Algorithms for approximation of functions (65D15) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05) Applications to the sciences (65Z05)
Cited In (only showing first 100 items - show all)
- Efficientd-multigrid preconditioners for sparse-grid solution of high-dimensional partial differential equations
- Orbit uncertainty propagation and sensitivity analysis with separated representations
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Non-incremental boundary element discretization of parabolic models based on the use of the proper generalized decompositions
- On the fast computation of high dimensional volume potentials
- Tensor spaces and hierarchical tensor representations
- Recent advances and new challenges in the use of the proper generalized decomposition for solving multidimensional models
- Musings on multilinear fitting
- Partitioned treatment of uncertainty in coupled domain problems: a separated representation approach
- Uncertainty propagation in orbital mechanics via tensor decomposition
- Proper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problems
- A priori model reduction through proper generalized decomposition for solving time-dependent partial differential equations
- Wave propagation using bases for bandlimited functions
- Tensor decomposition in electronic structure calculations on 3D Cartesian grids
- On the deterministic solution of multidimensional parametric models using the proper generalized decomposition
- Constructive representation of functions in low-rank tensor formats
- Approximate iterations for structured matrices
- Iterative methods based on soft thresholding of hierarchical tensors
- A numerical solver for high dimensional transient Fokker-Planck equation in modeling polymeric fluids
- Approximating a wavefunction as an unconstrained sum of Slater determinants
- Proper generalized decomposition of time-multiscale models
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- Randomized interpolative decomposition of separated representations
- Proper generalized decomposition of multiscale models
- Adaptive low-rank methods: problems on Sobolev spaces
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- Circumventing Curse of Dimensionality in the Solution of Highly Multidimensional Models Encountered in Quantum Mechanics Using Meshfree Finite Sums Decomposition
- On the convergence of a greedy rank-one update algorithm for a class of linear systems
- Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format
- A new characterization of Elfving's method for high dimensional computation
- Ideal minimal residual-based proper generalized decomposition for non-symmetric multi-field models -- application to transient elastodynamics in space-time domain
- Space-time proper generalized decompositions for the resolution of transient elastodynamic models
- High performance rearrangement and multiplication routines for sparse tensor arithmetic
- Q-less QR decomposition in inner product spaces
- Approximation of solutions to multidimensional parabolic equations by approximate approximations
- Multiresolution representation of operators with boundary conditions on simple domains
- \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling
- Black box low tensor-rank approximation using fiber-crosses
- On approximation of functions by exponential sums
- A projection method to solve linear systems in tensor format
- Fast multidimensional convolution in low-rank tensor formats via cross approximation
- Tensor-product approximation to operators and functions in high dimensions
- Tensor completion in hierarchical tensor representations
- Generic and typical ranks of multi-way arrays
- Greedy algorithms for high-dimensional eigenvalue problems
- Numerical solution of high dimensional stationary Fokker-Planck equations via tensor decomposition and Chebyshev spectral differentiation
- Krylov subspace projection method for Sylvester tensor equation with low rank right-hand side
- Stochastic algorithms in linear algebra -- beyond the Markov chains and von Neumann-Ulam scheme
- Low-rank separated representation surrogates of high-dimensional stochastic functions: application in Bayesian inference
- Fast adaptive algorithms in the non-standard form for multidimensional problems
- Truncated integration for simultaneous simulation of sintering using a separated representation
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- Optimization problems in contracted tensor networks
- Towards a 2.5D geometric model in mold filling simulation
- Use of tensor formats in elliptic eigenvalue problems.
- A literature survey of low-rank tensor approximation techniques
- Some convergence results on the regularized alternating least-squares method for tensor decomposition
- A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format
- Variational calculus with sums of elementary tensors of fixed rank
- Numerically explicit potentials for the homogenization of nonlinear elastic heterogeneous materials
- On the computation of high-dimensional potentials of advection-diffusion operators
- TT-cross approximation for multidimensional arrays
- Wave atoms and time upscaling of wave equations
- Alleviating mesh constraints: model reduction, parallel time integration and high resolution homogenization
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- Non-intrusive low-rank separated approximation of high-dimensional stochastic models
- Fast algorithms for Helmholtz Green's functions
- A preconditioned low-rank projection method with a rank-reduction scheme for stochastic partial differential equations
- Fast cubature of volume potentials over rectangular domains by approximate approximations
- Numerical tensor calculus
- Multiresolution separated representations of singular and weakly singular operators
- Chebfun in Three Dimensions
- Polynomial approximation of high-dimensional Hamilton-Jacobi-Bellman equations and applications to feedback control of semilinear parabolic PDEs
- Towards tensor-based methods for the numerical approximation of the Perron-Frobenius and Koopman operator
- Model's sparse representation based on reduced mixed GMsFE basis methods
- Weighted Moore-Penrose inverses of arbitrary-order tensors
- High dimensional numerical problems
- Jacobi-Davidson method on low-rank matrix manifolds
- Weak SINDy for partial differential equations
- Reduction of multivariate mixtures and its applications
- Fast low‐rank approximations of multidimensional integrals in ion‐atomic collisions modelling
- Reverse-order law for weighted Moore-Penrose inverse of tensors
- PDE formulation of some SABR/LIBOR market models and its numerical solution with a sparse grid combination technique
- Far-field compression for fast kernel summation methods in high dimensions
- Low-CP-rank tensor completion via practical regularization
- Title not available (Why is that?)
- Fast computation of elastic and hydrodynamic potentials using approximate approximations
- Fast computation of elastic and hydrodynamic potentials using approximate approximations
- Stochastic boundary methods of fundamental solutions for solving PDEs
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Fast cubature of high dimensional biharmonic potential based on approximate approximations
- Cubature, approximation, and isotropy in the hypercube
- On reverse-order law of tensors and its application to additive results on Moore-Penrose inverse
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- On the Compressibility of Tensors
- The Random Feature Model for Input-Output Maps between Banach Spaces
- Operator learning using random features: a tool for scientific computing
- Low-rank tensor methods for partial differential equations
- Tensor decomposition and high-performance computing for solving high-dimensional stochastic control system numerically
- SOTT: greedy approximation of a tensor as a sum of tensor trains
This page was built for publication: Algorithms for Numerical Analysis in High Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693182)
