A theory of pseudoskeleton approximations
From MaRDI portal
Publication:1362649
DOI10.1016/S0024-3795(96)00301-1zbMath0877.65021WikidataQ127471686 ScholiaQ127471686MaRDI QIDQ1362649
Evgenij E. Tyrtyshnikov, Sergei A. Goreinov, Nikolai L. Zamarashkin
Publication date: 5 August 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
Efficient Flexible Boundary Conditions for Long Dislocations, Frequency Extraction for BEM Matrices Arising From the 3D Scalar Helmholtz Equation, Fast Algorithms for Hyperspectral Diffuse Optical Tomography, Three matrix factorizations from the steps of elimination, Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix, Hierarchical Tensor Approximation of Output Quantities of Parameter-Dependent PDEs, The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces, A Generalized CUR Decomposition for Matrix Pairs, Tensor CUR Decomposition under T-Product and Its Perturbation, Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions, Coseparable Nonnegative Matrix Factorization, A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices, Numerical solutions of the time‐dependent Schrödinger equation with position‐dependent effective mass, Polynomial time \(\rho\)-locally maximum volume search, A hybrid stochastic interpolation and compression method for kernel matrices, Challenges of order reduction techniques for problems involving polymorphic uncertainty, Randomized algorithms in numerical linear algebra, New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem, The tensor-train mimetic finite difference method for three-dimensional Maxwell's wave propagation equations, Study of performance of low-rank nonnegative tensor factorization methods, CUR and Generalized CUR Decompositions of Quaternion Matrices and their Applications, A fast solver for the narrow capture and narrow escape problems in the sphere, Lower bounds for column matrix approximations, Generalized pseudoskeleton decompositions, Axisymmetric polyharmonic spline approximation in the dual reciprocity method, Online Interpolation Point Refinement for Reduced-Order Models using a Genetic Algorithm, Literature survey on low rank approximation of matrices, A GPU parallel randomized CUR compression method for the method of moments, Optimal CUR Matrix Decompositions, Matrices with Hierarchical Low-Rank Structures, Parallel cross interpolation for high-precision calculation of high-dimensional integrals, Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting, System Identification via CUR-Factored Hankel Approximation, Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition, On the Best Approximation of the Hierarchical Matrix Product, Random Sampling and Efficient Algorithms for Multiscale PDEs, Nonnegative Tensor Train Factorizations and Some Applications, Global Optimization Algorithms Using Tensor Trains, A fast dual boundary element method for 3D anisotropic crack problems, Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra, Petz recovery versus matrix reconstruction, Grid methods for Bayes-optimal continuous-discrete filtering and utilizing a functional tensor train representation, Fast truncation of mode ranks for bilinear tensor operations, Fast low‐rank approximations of multidimensional integrals in ion‐atomic collisions modelling, Iterative representing set selection for nested cross approximation, Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions, A New Selection Operator for the Discrete Empirical Interpolation Method---Improved A Priori Error Bound and Extensions, A fast hierarchical dual boundary element method for three-dimensional elastodynamic crack problems, Fast Algorithms for Boundary Integral Equations, Fast Coulomb Matrix Construction via Compressing the Interactions Between Continuous Charge Distributions, Evaluation of the Docking Algorithm Based on Tensor Train Global Pptimization, A DEIM Induced CUR Factorization, Fast, Adaptive, High-Order Accurate Discretization of the Lippmann--Schwinger Equation in Two Dimensions, Interpolative Decomposition via Proxy Points for Kernel Matrices, Less is More: Sparse Graph Mining with Compact Matrix Decomposition, 6 The Loewner framework for system identification and reduction, Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators, Riemannian Optimization for High-Dimensional Tensor Completion, Functional Tucker Approximation Using Chebyshev Interpolation, Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning, Perturbations of CUR Decompositions, Robust CUR Decomposition: Theory and Imaging Applications, CUR LRA at Sublinear Cost Based on Volume Maximization, A literature survey of low-rank tensor approximation techniques, Bridging and Improving Theoretical and Computational Electrical Impedance Tomography via Data Completion, LU and CR Elimination, Computing with Functions in Spherical and Polar Geometries II. The Disk, Adaptive cross approximation for ill-posed problems, Structured low rank approximation, Efficient algorithms for CUR and interpolative matrix decompositions, Matrix output extension of the tensor network Kalman filter with an application in MIMO Volterra system identification, An asymptotic Green's function method for the wave equation, A fast block low-rank dense solver with applications to finite-element matrices, A low-rank approach to the computation of path integrals, Linear algebra for tensor problems, An algorithm for low-rank approximation of bivariate functions using splines, Recursive decomposition of multidimensional tensors, Column subset selection problem is UG-hard, On the best approximation algorithm by low-rank matrices in Chebyshev's norm, Mosaic-skeleton method as applied to the numerical solution of three-dimensional Dirichlet problems for the Helmholtz equation in integral form, New studies of randomized augmentation and additive preprocessing, A unifying approach to the construction of circulant preconditioners, A randomized algorithm for a tensor-based generalization of the singular value decomposition, An ACA-SBM for some 2D steady-state heat conduction problems, Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format, Large-scale stochastic linear inversion using hierarchical matrices. Illustrated with an application to crosswell tomography in seismic imaging, Global and local optimization in identification of parabolic systems, Pseudo-skeleton approximations with better accuracy estimates, Error estimates for two-dimensional cross approximation, Low-rank approximation of integral operators by using the Green formula and quadrature, FFT-based homogenisation accelerated by low-rank tensor approximations, Rectangular maximum-volume submatrices and their applications, Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications, An asymptotic Green's function method for time-dependent Schrödinger equations with application to Kohn-Sham equations, A fast solver for spectral elements applied to fractional differential equations using hierarchical matrix approximation, Likelihood approximation with hierarchical matrices for large spatial datasets, Black box approximation of tensors in hierarchical Tucker format, Optimal rank matrix algebras preconditioners, A randomized algorithm for the decomposition of matrices, Adaptive cross approximation for Tikhonov regularization in general form, Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem, On the low-rank approximation by the pivoted Cholesky decomposition, Low complexity matrix projections preserving actions on vectors, A fast algorithm for multilinear operators, Global optimization based on TT-decomposition, Generalized cross approximation for 3D-tensors, An accelerated symmetric time-domain boundary element formulation for elasticity, Constructing nested bases approximations from the entries of non-local operators, An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation, A fast BEM for the analysis of damaged structures with bonded piezoelectric sensors, Representation of quasiseparable matrices using excluded sums and equivalent charges, Kronecker-product approximations for some function-related matrices., An ACA accelerated MFS for potential problems, Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm, A geometric mapping cross approximation method, Approximate iterations for structured matrices, Separation of variables for function generated high-order tensors, Functions and eigenvectors of partially known matrices with applications to network analysis, 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, Model reduction for Smoluchowski equations with particle transfer, On best uniform approximation by low-rank matrices, A continuous analogue of the tensor-train decomposition, Tensor based approach to the numerical treatment of the parameter estimation problems in mathematical immunology, Block-adaptive cross approximation of discrete integral operators, On cross approximation of multi-index arrays, Parallel tensor sampling in the hierarchical Tucker format, New accuracy estimates for pseudoskeleton approximations of matrices, A fast 3D dual boundary element method based on hierarchical matrices, Quasioptimality of maximum-volume cross interpolation of tensors, A note on tensor chain approximation, Restriction matrices for numerically exploiting symmetry, Fast construction of hierarchical matrix representation from matrix-vector multiplication, Fast directional algorithms for the Helmholtz kernel, Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation, Generalizing the column-row matrix decomposition to multi-way arrays, Nonnegative definite Hermitian matrices with increasing principal minors, 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, Solving a large dense linear system by adaptive cross approximation, Methods for nonnegative matrix factorization based on low-rank cross approximations, Approximation of integral operators by Green quadrature and nested cross approximation, TT-cross approximation for multidimensional arrays, Randomized interpolative decomposition of separated representations, Recompression techniques for adaptive cross approximation, CUR matrix decompositions for improved data analysis, New applications of matrix methods, On the accuracy of cross and column low-rank maxvol approximations in average, Low-rank approximation algorithms for matrix completion with random sampling, A fast technique applied to the analysis of resistive wall modes with 3D conducting structures, Restriction matrices in space-time energetic BEM, Perspectives on CUR decompositions, Application of hierarchical matrices for computing the Karhunen-Loève expansion, A second-order fast Huygens sweeping method for time-dependent Schrödinger equations with perfectly matched layers, An extended DEIM algorithm for subset selection and class identification, Optimal truncations for multivariate Fourier and Chebyshev series: mysteries of the hyperbolic cross. I: bivariate case, Approximation and sampling of multivariate probability distributions in the tensor train decomposition, Nonnegative tensor train factorization with DMRG technique, On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices, Faster tensor train decomposition for sparse data, Approximation of matrices with logarithmic number of parameters, Application of mosaic-skeleton approximations of matrices in the physical optics method for electromagnetic scattering problems, On the existence and computation of rank-revealing LU factorizations, Hybrid cross approximation of integral operators, Tensor properties of multilevel Toeplitz and related matrices, Deep composition of tensor-trains using squared inverse Rosenblatt transports, Solving linear systems using wavelet compression combined with Kronecker product approx\-i\-ma\-tion
Cites Work
