Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework
DOI10.1137/21M1462155OpenAlexW4318764269MaRDI QIDQ5885802FDOQ5885802
Authors: Iveta Hnetynkova, Martin Plešinger, Jana Žáková 
Publication date: 30 March 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1462155
Recommendations
- The core problem within a linear approximation problem \(AX\approx B\) with multiple right-hand sides
- Band generalization of the Golub-Kahan bidiagonalization, generalized Jacobi matrices, and the core problem
- Lanczos tridiagonalization and core problems
- Core Problems in Linear Algebraic Systems
- Krylov-type methods for tensor computations.I
Krylov subspace methodstotal least squaresorthogonal transformationscore problemerror-in-variables modeling(multi)linear approximation problems
Eigenvalues, singular values, and eigenvectors (15A18) Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Linear equations (linear algebraic aspects) (15A06) Orthogonalization in numerical linear algebra (65F25)
Cites Work
- Title not available (Why is that?)
- Tensor Decompositions and Applications
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- An Analysis of the Total Least Squares Problem
- Title not available (Why is that?)
- Tensor numerical methods in scientific computing
- Algebraic relations between the total least squares and least squares problems with more than one solution
- Singular value decomposition and least squares solutions
- Scaled total least squares fundamentals
- The total least squares problem in \(AX \approx B\): A new classification with the relationship to the classical works
- Some Modified Matrix Eigenvalue Problems
- Consistent estimation in the bilinear multivariate errors-in-variables model
- Solution of linear algebraic systems with rectangular matrices
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- The Analysis for the Total Least Squares Problem with More Than One Solution
- Core Problems in Linear Algebraic Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Updating a Rank-Revealing ULV Decomposition
- Randomized algorithms for total least squares problems
- Quantum algorithm for total least squares data fitting
- Least squares data fitting with applications
- Band generalization of the Golub-Kahan bidiagonalization, generalized Jacobi matrices, and the core problem
- Complex wedge-shaped matrices: a generalization of Jacobi matrices
- Analysis of the generalized total least squares problem \(AX\approx B\) when some columns of \(A\) are free of error
- Title not available (Why is that?)
- Stability of the solutions of linear least squares problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The extended classical total least squares algorithm
- Extension of the total least square problem using general unitarily invariant norms
- TLS formulation and core reduction for problems with structured right-hand sides
- The core problem within a linear approximation problem \(AX\approx B\) with multiple right-hand sides
- Total least squares problem with the arbitrary unitarily invariant norms
- Solvability of the core problem with multiple right-hand sides in the TLS sense
- Title not available (Why is that?)
- On TLS formulation and core reduction for data fitting with generalized models
- The original tls solution sets of the multidimensional TLS problem∗
- Randomized core reduction for discrete ill-posed problem
Cited In (3)
Uses Software
This page was built for publication: Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885802)
