Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- New applications of matrix methods
- A fast technique applied to the analysis of resistive wall modes with 3D conducting structures
- Computing with functions in spherical and polar geometries. II: The disk
- Iterative representing set selection for nested cross approximation.
- A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
- Numerical solutions of the time‐dependent Schrödinger equation with position‐dependent effective mass
- Rectangular maximum-volume submatrices and their applications
- Low-rank approximation of a matrix: novel insights, new progress, and extensions
- Functions and eigenvectors of partially known matrices with applications to network analysis
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- Likelihood approximation with hierarchical matrices for large spatial datasets
- Matrix output extension of the tensor network Kalman filter with an application in MIMO Volterra system identification
- Low-rank approximation algorithms for matrix completion with random sampling
- On the accuracy of cross and column low-rank maxvol approximations in average
- Polynomial time \(\rho\)-locally maximum volume search
- Application of mosaic-skeleton approximations of matrices in the physical optics method for electromagnetic scattering problems
- An extended DEIM algorithm for subset selection and class identification
- Online interpolation point refinement for reduced-order models using a genetic algorithm
- Model reduction for Smoluchowski equations with particle transfer
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- An asymptotic Green's function method for the wave equation
- Fast directional algorithms for the Helmholtz kernel
- System identification via CUR-factored Hankel approximation
- A two-stage surrogate model for neo-Hookean problems based on adaptive proper orthogonal decomposition and hierarchical tensor approximation
- The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces
- Functional Tucker approximation using Chebyshev interpolation
- Nonnegative Tensor Train Factorizations and Some Applications
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Fast truncation of mode ranks for bilinear tensor operations
- Fast, adaptive, high-order accurate discretization of the Lippmann-Schwinger equation in two dimensions
- Random sampling and efficient algorithms for multiscale PDEs
- A fast block low-rank dense solver with applications to finite-element matrices
- Randomized interpolative decomposition of separated representations
- Riemannian optimization for high-dimensional tensor completion
- On the existence of a nearly optimal skeleton approximation of a matrix in the Frobenius norm
- Restriction matrices for numerically exploiting symmetry
- Approximation of integral operators by Green quadrature and nested cross approximation
- Optimal truncations for multivariate Fourier and Chebyshev series: mysteries of the hyperbolic cross. I: bivariate case
- A fast dual boundary element method for 3D anisotropic crack problems
- A second-order fast Huygens sweeping method for time-dependent Schrödinger equations with perfectly matched layers
- Robust CUR Decomposition: Theory and Imaging Applications
- A DEIM induced CUR factorization
- Global Optimization Algorithms Using Tensor Trains
- Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators
- 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
- Faster tensor train decomposition for sparse data
- FFT-based homogenisation accelerated by low-rank tensor approximations
- Deep composition of tensor-trains using squared inverse Rosenblatt transports
- 6 The Loewner framework for system identification and reduction
- Optimal rank matrix algebras preconditioners
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- Preconditioning linear least-squares problems by identifying a basis matrix
- Low complexity matrix projections preserving actions on vectors
- Restriction matrices in space-time energetic BEM
- A fast solver for spectral elements applied to fractional differential equations using hierarchical matrix approximation
- Adaptive cross approximation for ill-posed problems
- A fast hierarchical dual boundary element method for three-dimensional elastodynamic crack problems
- Quasioptimality of maximum-volume cross interpolation of tensors
- 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.
- Column subset selection problem is UG-hard
- Generalized cross approximation for 3D-tensors
- TT-cross approximation for multidimensional arrays
- A fast algorithm for multilinear operators
- Linear algebra for tensor problems
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- CUR matrix decompositions for improved data analysis
- Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
- Solving a large dense linear system by adaptive cross approximation
- Black box approximation of tensors in hierarchical Tucker format
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- A unifying approach to the construction of circulant preconditioners
- Evaluation of the docking algorithm based on tensor train global optimization
- An accelerated symmetric time-domain boundary element formulation for elasticity
- On cross approximation of multi-index arrays
- A literature survey of low-rank tensor approximation techniques
- A continuous analogue of the tensor-train decomposition
- Constructing nested bases approximations from the entries of non-local operators
- Recompression techniques for adaptive cross approximation
- Randomized algorithms in numerical linear algebra
- Hybrid cross approximation of integral operators
- Tensor based approach to the numerical treatment of the parameter estimation problems in mathematical immunology
- Efficient algorithms for CUR and interpolative matrix decompositions
- Low-rank approximation of integral operators by using the Green formula and quadrature
- Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications
- Application of hierarchical matrices for computing the Karhunen-Loève expansion
- How to find a good submatrix
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition
- Tensor properties of multilevel Toeplitz and related matrices
- An algorithm for low-rank approximation of bivariate functions using splines
- Pseudo-skeleton approximations with better accuracy estimates
- Kronecker-product approximations for some function-related matrices.
- A fast 3D dual boundary element method based on hierarchical matrices
- Literature survey on low rank approximation of matrices
- Fast Algorithms for Boundary Integral Equations
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)
