Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Lehmer–Schur algorithm

Known as: Lehmer, Schur algorithm, Lehmer-Schur Algorithm 
In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm extending the idea of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2002
Highly Cited
2002
  • G. Stewart
  • SIAM J. Matrix Anal. Appl.
  • 2002
  • Corpus ID: 30958183
Sorensen's implicitly restarted Arnoldi algorithm is one of the most successful and flexible methods for finding a few eigenpairs… Expand
Is this relevant?
1998
1998
In this paper, a novel 2-D Schur algorithm is developed as a natural extension of the 1-D Schur recursion. This lattice structure… Expand
Is this relevant?
1996
1996
We present a new algorithm for solving the Sylvester observer equation arising in the context of the Luenberger observer. The… Expand
  • figure 6
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Abstract Numerically reliable computational methods are proposed for the stabilization of a linear descriptor system with or… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper deals with the rational approximation of specified order n to transfer functions which are assumed to be matrix-valued… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
  • G. K. Kaleh
  • IEEE J. Sel. Areas Commun.
  • 1995
  • Corpus ID: 32927034
In a block transmission system the information symbols are arranged in the form of blocks separated by known symbols. Such a… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We describe an implementation of the generalized Schur algorithm for the superfast solution of real positive definite Toeplitz… Expand
Is this relevant?
1985
1985
The Schur algorithm and its time-domain counterpart, the fast Cholseky recursions, are some efficient signal processing… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
In this paper, an algorithm is developed for the realization of any stable, passive digital rational transfer function in a… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
An exact and approximate realization theory for estimation and model filters of second-order stationary stochastic sequences is… Expand
Is this relevant?