Pages that link to "Item:Q920570"
From MaRDI portal
The following pages link to Parallel and superfast algorithms for Hankel systems of equations (Q920570):
Displaying 14 items.
- The Lanczos algorithm and Hankel matrix factorization (Q1194514) (← links)
- A framework for polynomial preconditioners based on fast transforms. I: Theory (Q1272881) (← links)
- Displacement structure of generalized inverse matrices (Q1338511) (← links)
- Hankel matrices of finite rank with applications to signal processing and polynomials (Q1359615) (← links)
- Iterative methods for discrete nonlinear Riemann-Hilbert problems (Q1802164) (← links)
- Recursive solution of Cauchy-Vandermonde systems of equations (Q1805194) (← links)
- Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile (Q1887505) (← links)
- Vandermonde factorization and canonical representations of block Hankel matrices (Q1923152) (← links)
- A new algorithm for computing orthogonal polynomials (Q2564266) (← links)
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations (Q3584165) (← links)
- (Q3974777) (← links)
- Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices (Q5935370) (← links)
- Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem. (Q5940720) (← links)
