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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Speech segmentation is an essential stage in designing automatic speech recognition systems and one can find several algorithms… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized version of Newton’s method, but… (More)
  • figure 3.1
  • figure 4.1
  • table 5.1
  • table 5.2
Is this relevant?
Highly Cited
2002
Highly Cited
2001
Highly Cited
2001
Third-generation mobile radio systems use time division-code division multiple access (TD-CDMA) in their time division duplex… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
  • MICHAEL STEWART y AND PAUL VAN DOOREN
  • 1997
This paper provides an error analysis of the generalized Schur algorithm of Kailath and Chun|a class of algorithms which can be… (More)
Is this relevant?
1996
1996
This paper provides a detailed analysis that shows how to stabilize the generalized Schur algorithm, which is a fast procedure… (More)
  • table 8.1
Is this relevant?
1995
1995
  • Pascale Fulcheri, Martine OliviProgramme
  • 1995
This paper deals with the rational approximation of specified order n to transfer functions which are assumed to be matrix-valued… (More)
Is this relevant?
1995
1995
Numerically reliable computational methods are proposed for the stabilization of a linear descriptor system with or without… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Abstract. We describe an implementation of the generalized Schur algorithm for the superfast solution of real positive definite… (More)
Is this relevant?