scientific article; zbMATH DE number 1350351
From MaRDI portal
Publication:4265495
Recommendations
Cited in
(81)- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Fast robust regression algorithms for problems with Toeplitz structure
- The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub
- Application of FFT-based algorithms for large-scale universal kriging problems
- Computations with infinite Toeplitz matrices and polynomials
- Inverse scattering experiments, structured matrix inequalities, and tensor algebra
- Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform
- Structured matrices and Newton's iteration: unified approach
- Non-skip-free M/G/1-type Markov chains and Laurent matrix power series
- On the discretization and application of two space-time boundary integral equations for 3D wave propagation problems in unbounded domains
- Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach
- Efficient authentication from hard learning problems
- 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
- An efficient solution for Cauchy-like systems of linear equations
- Newton-like iteration based on a cubic polynomial for structured matrices
- 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 implementation of a structured total least squares based speech compression method
- Fast scattered data approximation with Neumann and other boundary conditions
- Implementation of the regularized structured total least squares algorithms for blind image deblurring
- Comparisons of several algorithms for Toeplitz matrix recovery
- Efficient vectors for simple perturbed consistent matrices
- Fast commutative matrix algorithms
- On the inversion of the block double-structured and of the triple-structured Toeplitz matrices and on the corresponding reflection coefficients
- Arov-Krein entropy functionals and indefinite interpolation problems
- The generalized Schur algorithm and some applications
- A mean value algorithm for Toeplitz matrix completion
- Computations with quasiseparable polynomials and matrices
- Multi-dimensional Capon spectral estimation using discrete Zhang neural networks
- Low complexity matrix projections preserving actions on vectors
- Fast algorithms for Toeplitz and Hankel matrices
- A Levinson-like algorithm for symmetric strongly nonsingular higher order semiseparable plus band matrices
- A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
- On certain (block) Toeplitz matrices related to radial functions
- A fast symmetric SVD algorithm for square Hankel matrices
- Tensor algebras and displacement structure. IV. Invariant kernels
- Fast direct solvers for some complex symmetric block Toeplitz linear systems
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- Direct inversion of the three-dimensional pseudo-polar Fourier transform
- Inverting structured operators related to Toeplitz plus Hankel operators
- Shift-invert Lanczos method for the symmetric positive semidefinite Toeplitz matrix exponential.
- Fast computation of the matrix exponential for a Toeplitz matrix
- Some comments on developments in exact solutions in statistical mechanics Since 1944
- A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
- Asymptotic properties of the QR factorization of banded Hessenberg–Toeplitz matrices
- Structured matrix methods for CAGD: an application to computing the resultant of polynomials in the Bernstein basis
- An extended QR-solver for large profiled matrices
- Fast O(n) complexity algorithms for diagonal innovation matrices
- On the acceleration of an algorithm for polynomial factorization
- A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
- On functions of quasi-Toeplitz matrices
- Reliable Krylov-based algorithms for matrix null space and rank
- A survey of spectral factorization methods
- A scalable gaussian process analysis algorithm for biomass monitoring
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
- On the structure of the inverse to Toeplitz-block Toeplitz matrices and of the corresponding polynomial reflection coefficients
- scientific article; zbMATH DE number 2232794 (Why is no real title available?)
- Homotopic residual correction processes
- Nearly optimal computations with structured matrices
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
- A fast algorithm for subspace state-space system identification via exploitation of the displacement structure
- Essential spectral equivalence via multiple step preconditioning and applications to ill conditioned Toeplitz matrices
- A probabilistic algorithm for determining the fundamental matrix of a block M/G/1 Markov chain
- Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation
- Bernstein-Bézoutian matrices
- Iterative inversion of structured matrices
- Skew-polynomial-sparse matrix multiplication
- A fast solver for linear systems with displacement structure
- Memoryless block transceivers with minimum redundancy based on Hartley transforms
- Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications
- 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
- Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems
- A low-complexity algorithm to digitally uncouple the mutual coupling effect in antenna arrays via symmetric Toeplitz matrices
- A low-complexity algorithm to search for Legendre pairs
- Fast phase factor finding for quantum signal processing
- A Toeplitz algorithm for polynomial J-spectral factorization
- Multivariate Frobenius-Padé approximants: properties and algorithms
- A multilevel parallel algorithm to solve symmetric Toeplitz linear systems
- Fast computation of determinants of Bézout matrices and application to curve implicitization
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)
