Approximate iterations for structured matrices
From MaRDI portal
Publication:929359
The paper deals with the evaluation of a matrix-valued function \(f(A)\), where \(A\) is a large matrix with a special structure. The authors present a transformation of an iterative fixed-point like process, under certain general assumptions, into another process which preserves the convergence rate and benefits from the underlying structure. Applications are also given for \(f(A) = A^{-1}\) and \(f(A) = \sqrt{A}\).
Recommendations
- Evaluating non-analytic functions of matrices
- Monotone convergence of the Lanczos approximations to matrix functions of Hermitian matrices
- Approximating the matrix sign function using a novel iterative method
- Iterative methods for computing the matrix square root
- Generalized averaged Gauss quadrature rules for the approximation of matrix functionals
Cites work
- A Multilinear Singular Value Decomposition
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A theory of pseudoskeleton approximations
- Adaptive solution of partial differential equations in multiwavelet bases
- Algorithms for Numerical Analysis in High Dimensions
- Combining Kronecker Product Approximation with Discrete Wavelet Transforms to Solve Dense, Function-Related Linear Systems
- Construction and arithmetics of \(\mathcal H\)-matrices
- Data-sparse approximation to a class of operator-valued functions
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L^-coefficients
- Fast spectral projection algorithms for density-matrix computations
- Hierarchical Kronecker tensor-product approximations
- Hierarchical matrices based on a weak admissibility criterion
- Hierarchical tensor-product approximation to the inverse and related operators for high-dimensional elliptic problems
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 1569013 (Why is no real title available?)
- scientific article; zbMATH DE number 1855970 (Why is no real title available?)
- scientific article; zbMATH DE number 2206814 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Incomplete cross approximation in the mosaic-skeleton method
- Kronecker-product approximations for some function-related matrices.
- Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators I. Separable approximation of multi-variate functions
- Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators II. HKT representation of certain operators
- Matrix approximations and solvers using tensor products and non-standard wavelet transforms related to irregular grids
- Matrix-free iterative solution strategies for large dense linear systems
- Mosaic-skeleton approximations
- Newton's Method for the Matrix Square Root
- Numerical operator calculus in higher dimensions
- Solution of large scale algebraic matrix Riccati equations by use of hierarchical matrices
- Stable iterations for the matrix square root
- Tensor approximations of matrices generated by asymptotically smooth functions
- Tensor properties of multilevel Toeplitz and related matrices
- The matrix sign function
- The Matrix Sign Function Method and the Computation of Invariant Subspaces
- Wave propagation using bases for bandlimited functions
Cited in
(54)- Matrix inversion cases with size-independent tensor rank estimates
- The tensor structure of the inverse of a banded Toeplitz matrix
- Solution of linear systems in high spatial dimensions
- A tensor-train accelerated solver for integral equations in complex geometries
- A dynamical adaptive tensor method for the Vlasov-Poisson system
- 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
- Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
- Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation
- Modified iterations for data-sparse solution of linear systems
- Solving differential Riccati equations: a nonlinear space-time method using tensor trains
- Low-rank tensor methods for Markov chains with applications to tumor progression models
- Tensor rank bounds for point singularities in \(\mathbb{R}^3\)
- Quasi-optimal rank-structured approximation to multidimensional parabolic problems by Cayley transform and Chebyshev interpolation
- Iterative methods based on soft thresholding of hierarchical tensors
- Low rank Tucker-type tensor approximation to classical potentials
- Tensor-product approximation to operators and functions in high dimensions
- Superfast solution of linear convolutional Volterra equations using QTT approximation
- The matrix ridge approximation: algorithms and applications
- A literature survey of low-rank tensor approximation techniques
- Sparse representations in stochastic mechanics
- Constrained optimization with low-rank tensors and applications to parametric problems with PDEs
- Matrix Approaches for Variable Precision Rough Approximations
- Solving stochastic systems with low-rank tensor compression
- Modified SMS method for computing outer inverses of Toeplitz matrices
- Numerical tensor calculus
- The Solution to a Structured Matrix Approximation Problem Using GrassmanCoordinates
- Use of tensor formats in elliptic eigenvalue problems.
- Adaptive low-rank approximations for operator equations: accuracy control and computational complexity
- Efficient approximation of functions of some large matrices by partial fraction expansions
- Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
- Hierarchical Matrix Approximations of Hessians Arising in Inverse Problems Governed by PDEs
- Input matrix construction and approximation using a graphic approach
- To be or not to be intrusive? The solution of parametric and stochastic equations -- proper generalized decomposition
- Time integration of tensor trains
- Tensor spaces and hierarchical tensor representations
- \(\mathcal{H}\)-matrix based second moment analysis for rough random fields and finite element discretizations
- A Low-Rank Multigrid Method for the Stochastic Steady-State Diffusion Problem
- A projection method to solve linear systems in tensor format
- Bayesian inversion for electromyography using low-rank tensor formats
- Nearly optimal computations with structured matrices
- Low-rank tensor methods for partial differential equations
- Low‐rank linear fluid‐structure interaction discretizations
- Multiresolution kernel matrix algebra
- Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
- Operator-dependent prolongation and restriction for the parameter-dependent multigrid method using low-rank tensor formats
- Chebyshev-type methods and preconditioning techniques
- Iterative algorithms for the post-processing of high-dimensional data
- Iterative algorithms for large stochastic matrices
- Linear algebra for tensor problems
- Tensor-structured preconditioners and approximate inverse of elliptic operators in \(\mathbb R^{d}\)
- Recursive decomposition of multidimensional tensors
- Adaptive near-optimal rank tensor approximation for high-dimensional operator equations
- \(\mathcal H\)-matrix accelerated second moment analysis for potentials with rough correlation
This page was built for publication: Approximate iterations for structured matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q929359)
