A theory of pseudoskeleton approximations
From MaRDI portal
Publication:1362649
DOI10.1016/S0024-3795(96)00301-1zbMATH Open0877.65021WikidataQ127471686 ScholiaQ127471686MaRDI QIDQ1362649FDOQ1362649
Authors: S. A. Goreinov, E. E. Tyrtyshnikov, N. L. Zamarashkin 
Publication date: 5 August 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (only showing first 100 items - show all)
- On cross approximation of multi-index arrays
- Approximation of matrices with logarithmic number of parameters
- Tensor based approach to the numerical treatment of the parameter estimation problems in mathematical immunology
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition
- Generalizing the column-row matrix decomposition to multi-way arrays
- A fast solver for spectral elements applied to fractional differential equations using hierarchical matrix approximation
- An ACA-SBM for some 2D steady-state heat conduction problems
- Adaptive cross approximation for ill-posed problems
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- A randomized algorithm for the decomposition of matrices
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Column subset selection problem is UG-hard
- An accelerated symmetric time-domain boundary element formulation for elasticity
- How to find a good submatrix
- A generalized CUR decomposition for matrix pairs
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- A fast algorithm for multilinear operators
- Linear algebra for tensor problems
- A unifying approach to the construction of circulant preconditioners
- Approximate iterations for structured matrices
- Generalized cross approximation for 3D-tensors
- Solving a large dense linear system by adaptive cross approximation
- A continuous analogue of the tensor-train decomposition
- Perspectives on CUR decompositions
- Efficient algorithms for CUR and interpolative matrix decompositions
- Constructing nested bases approximations from the entries of non-local operators
- Application of hierarchical matrices for computing the Karhunen-Loève expansion
- Global optimization based on TT-decomposition
- Recompression techniques for adaptive cross approximation
- An algorithm for low-rank approximation of bivariate functions using splines
- An ACA accelerated MFS for potential problems
- Pseudo-skeleton approximations with better accuracy estimates
- Error estimates for two-dimensional cross approximation
- Mosaic-skeleton method as applied to the numerical solution of three-dimensional Dirichlet problems for the Helmholtz equation in integral form
- Evaluation of the docking algorithm based on tensor train global optimization
- Structured low rank approximation
- A fast hierarchical dual boundary element method for three-dimensional elastodynamic crack problems
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- New studies of randomized augmentation and additive preprocessing
- Fast Algorithms for Boundary Integral Equations
- Separation of variables for function generated high-order tensors
- Hybrid cross approximation of integral operators
- Tensor properties of multilevel Toeplitz and related matrices
- Black box approximation of tensors in hierarchical Tucker format
- Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
- Literature survey on low rank approximation of matrices
- On the low-rank approximation by the pivoted Cholesky decomposition
- A literature survey of low-rank tensor approximation techniques
- Rectangular submatrices of maximum volume and their computation
- Kriging and spatial design accelerated by orders of magnitude: combining low-rank covariance approximations with FFT-techniques
- On best uniform approximation by low-rank matrices
- Representation of quasiseparable matrices using excluded sums and equivalent charges
- A fast BEM for the analysis of damaged structures with bonded piezoelectric sensors
- Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
- On the existence and computation of rank-revealing LU factorizations
- TT-cross approximation for multidimensional arrays
- CUR matrix decompositions for improved data analysis
- Recursive decomposition of multidimensional tensors
- Quasioptimality of maximum-volume cross interpolation of tensors
- Low-rank approximation of integral operators by using the Green formula and quadrature
- A fast 3D dual boundary element method based on hierarchical matrices
- The tensor-train mimetic finite difference method for three-dimensional Maxwell's wave propagation equations
- Kronecker-product approximations for some function-related matrices.
- Parallel tensor sampling in the hierarchical Tucker format
- New accuracy estimates for pseudoskeleton approximations of matrices
- Randomized algorithms in numerical linear algebra
- Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications
- A note on tensor chain approximation
- Model reduction for Smoluchowski equations with particle transfer
- Deep composition of tensor-trains using squared inverse Rosenblatt transports
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- A fast dual boundary element method for 3D anisotropic crack problems
- Numerical solutions of the time‐dependent Schrödinger equation with position‐dependent effective mass
- Online interpolation point refinement for reduced-order models using a genetic algorithm
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Low-rank approximation of a matrix: novel insights, new progress, and extensions
- Fast, adaptive, high-order accurate discretization of the Lippmann-Schwinger equation in two dimensions
- Riemannian optimization for high-dimensional tensor completion
- A second-order fast Huygens sweeping method for time-dependent Schrödinger equations with perfectly matched layers
- Fast directional algorithms for the Helmholtz kernel
- New applications of matrix methods
- A DEIM induced CUR factorization
- Functions and eigenvectors of partially known matrices with applications to network analysis
- Matrix output extension of the tensor network Kalman filter with an application in MIMO Volterra system identification
- Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation
- Nonnegative definite Hermitian matrices with increasing principal minors
- Computing with functions in spherical and polar geometries. II: The disk
- System identification via CUR-factored Hankel approximation
- On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
- Approximation of integral operators by Green quadrature and nested cross approximation
- Global Optimization Algorithms Using Tensor Trains
- Preconditioning linear least-squares problems by identifying a basis matrix
- Iterative representing set selection for nested cross approximation.
- An asymptotic Green's function method for the wave equation
- A two-stage surrogate model for neo-Hookean problems based on adaptive proper orthogonal decomposition and hierarchical tensor approximation
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Robust CUR Decomposition: Theory and Imaging Applications
- Randomized interpolative decomposition of separated representations
This page was built for publication: A theory of pseudoskeleton approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362649)
