Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework
From MaRDI portal
Publication:5885802
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
Cites work
- scientific article; zbMATH DE number 51511 (Why is no real title available?)
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 1734139 (Why is no real title available?)
- scientific article; zbMATH DE number 1058095 (Why is no real title available?)
- scientific article; zbMATH DE number 1058103 (Why is no real title available?)
- scientific article; zbMATH DE number 1748538 (Why is no real title available?)
- scientific article; zbMATH DE number 1748549 (Why is no real title available?)
- scientific article; zbMATH DE number 1748559 (Why is no real title available?)
- Algebraic relations between the total least squares and least squares problems with more than one solution
- An Analysis of the Total Least Squares Problem
- Analysis of the generalized total least squares problem \(AX\approx B\) when some columns of \(A\) are free of error
- Band generalization of the Golub-Kahan bidiagonalization, generalized Jacobi matrices, and the core problem
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Complex wedge-shaped matrices: a generalization of Jacobi matrices
- Consistent estimation in the bilinear multivariate errors-in-variables model
- Core Problems in Linear Algebraic Systems
- Extension of the total least square problem using general unitarily invariant norms
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Least squares data fitting with applications
- On TLS formulation and core reduction for data fitting with generalized models
- Quantum algorithm for total least squares data fitting
- Randomized algorithms for total least squares problems
- Randomized core reduction for discrete ill-posed problem
- Scaled total least squares fundamentals
- Singular value decomposition and least squares solutions
- Solution of linear algebraic systems with rectangular matrices
- Solvability of the core problem with multiple right-hand sides in the TLS sense
- Some Modified Matrix Eigenvalue Problems
- Stability of the solutions of linear least squares problems
- TLS formulation and core reduction for problems with structured right-hand sides
- Tensor Decompositions and Applications
- Tensor numerical methods in scientific computing
- The Analysis for the Total Least Squares Problem with More Than One Solution
- The core problem within a linear approximation problem \(AX\approx B\) with multiple right-hand sides
- The extended classical total least squares algorithm
- The original tls solution sets of the multidimensional TLS problem∗
- The total least squares problem in \(AX \approx B\): A new classification with the relationship to the classical works
- Total least squares problem with the arbitrary unitarily invariant norms
- Updating a Rank-Revealing ULV Decomposition
Cited in
(3)
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)