scientific article; zbMATH DE number 1350351
From MaRDI portal
Publication:4265495
zbMATH Open0931.65018MaRDI QIDQ4265495FDOQ4265495
Authors:
Publication date: 17 October 1999
Title of this publication is not available (Why is that?)
Recommendations
iterative methodsNewton's methodtextbookstructured matricespreconditioned conjugate gradient methodstriangular factorizationfast numerical algorithms
Direct numerical methods for linear systems and matrix inversion (65F05) Hermitian, skew-Hermitian, and related matrices (15B57) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10)
Cited In (78)
- On the acceleration of an algorithm for polynomial factorization
- A scalable gaussian process analysis algorithm for biomass monitoring
- Inverting structured operators related to Toeplitz plus Hankel operators
- Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation
- Title not available (Why is that?)
- Tensor algebras and displacement structure. IV. Invariant kernels
- Computations with infinite Toeplitz matrices and polynomials
- An efficient solution for Cauchy-like systems of linear equations
- On the inversion of the block double-structured and of the triple-structured Toeplitz matrices and on the corresponding reflection coefficients
- A Toeplitz algorithm for polynomial \(J\)-spectral factorization
- Fast robust regression algorithms for problems with Toeplitz structure
- A fast symmetric SVD algorithm for square Hankel matrices
- Fast scattered data approximation with Neumann and other boundary conditions
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
- A mean value algorithm for Toeplitz matrix completion
- Iterative inversion of structured matrices
- A survey of spectral factorization methods
- Inverse scattering experiments, structured matrix inequalities, and tensor algebra
- Fast computation of determinants of Bézout matrices and application to curve implicitization
- A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain
- Structured matrices in numerical linear algebra. Analysis, algorithms and applications. Selected papers based on the presentations at the INdAM meeting, Cortona, Italy, September 4--8, 2017
- A fast algorithm for subspace state-space system identification via exploitation of the displacement structure
- Structured matrices and Newton's iteration: unified approach
- Low complexity matrix projections preserving actions on vectors
- Fast O(n) complexity algorithms for diagonal innovation matrices
- Multivariate Frobenius-Padé approximants: properties and algorithms
- Memoryless block transceivers with minimum redundancy based on Hartley transforms
- Fast commutative matrix algorithms
- Newton-like iteration based on a cubic polynomial for structured matrices
- Fast algorithms for Toeplitz and Hankel matrices
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Fast direct solvers for some complex symmetric block Toeplitz linear systems
- Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform
- On functions of quasi-Toeplitz matrices
- Implementation of the regularized structured total least squares algorithms for blind image deblurring
- Asymptotic properties of the QR factorization of banded Hessenberg–Toeplitz matrices
- Homotopic residual correction processes
- Non-skip-free M/G/1-type Markov chains and Laurent matrix power series
- A fast solver for linear systems with displacement structure
- Comparisons of several algorithms for Toeplitz matrix recovery
- Fast kernel smoothing by a low-rank approximation of the kernel Toeplitz matrix
- New ``Verblunsky-type coefficients of block Toeplitz and Hankel matrices and of corresponding Dirac and canonical systems
- Efficient vectors for simple perturbed consistent matrices
- On the discretization and application of two space-time boundary integral equations for 3D wave propagation problems in unbounded domains
- Fast computation of the matrix exponential for a Toeplitz matrix
- A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
- Some comments on developments in exact solutions in statistical mechanics Since 1944
- Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach
- Essential spectral equivalence via multiple step preconditioning and applications to ill conditioned Toeplitz matrices
- Multi-dimensional Capon spectral estimation using discrete Zhang neural networks
- Shift-invert Lanczos method for the symmetric positive semidefinite Toeplitz matrix exponential.
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
- Nearly optimal computations with structured matrices
- A multilevel parallel algorithm to solve symmetric Toeplitz linear systems
- Efficient authentication from hard learning problems
- Bernstein-Bézoutian matrices
- The generalized Schur algorithm and some applications
- Efficient implementation of a structured total least squares based speech compression method
- Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
- On the structure of the inverse to Toeplitz-block Toeplitz matrices and of the corresponding polynomial reflection coefficients
- A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
- Application of FFT-based algorithms for large-scale universal kriging problems
- The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub
- Computations with quasiseparable polynomials and matrices
- Reliable Krylov-based algorithms for matrix null space and rank
- Title not available (Why is that?)
- Skew-polynomial-sparse matrix multiplication
- On certain (block) Toeplitz matrices related to radial functions
- Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications
- A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
- An aggregation-based two-grid method for multilevel block Toeplitz linear systems
- A continuation method for solving symmetric Toeplitz systems
- On generating Sobolev orthogonal polynomials
- An extended QR-solver for large profiled matrices
- Arov-Krein entropy functionals and indefinite interpolation problems
- Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems
- Direct inversion of the three-dimensional pseudo-polar Fourier transform
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265495)
