Some Remarks on the Generalised Bareiss and Levinson Algorithms
暂无分享,去创建一个
[1] Thomas Kailath,et al. Linear complexity parallel algorithms for linear systems of equations with recursive structure , 1987 .
[2] N. Levinson. The Wiener (Root Mean Square) Error Criterion in Filter Design and Prediction , 1946 .
[3] Jean-Marc Delosme,et al. Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.
[4] C. Lawson,et al. Solving least squares problems , 1976, Classics in applied mathematics.
[5] J. Schur,et al. Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind. , 1917 .
[6] Y. Kamp,et al. A method of matrix inverse triangular decomposition based on contiguous principal submatrices , 1980 .
[7] James R. Bunch,et al. Stability of Methods for Solving Toeplitz Systems of Equations , 1985 .
[8] J. L. Hock,et al. An exact recursion for the composite nearest‐neighbor degeneracy for a 2×N lattice space , 1984 .
[9] Ilse C. F. Ipsen. Systolic Algorithms for the Parallel Solution of Dense Symmetric Positive-Definite Toeplitz Systems , 1988 .
[10] Martin H. Schultz,et al. Numerical Algorithms for Modern Parallel Computer Architectures , 1988 .
[11] Gene H. Golub,et al. Matrix computations , 1983 .
[12] E. Bareiss. Numerical solution of linear equations with Toeplitz and Vector Toeplitz matrices , 1969 .
[13] Ilse C. F. Ipsen,et al. From Bareiss' Algorithm to the Stable Computation of Partial Correlations , 1989 .
[14] Ilse C. F. Ipsen,et al. Parallel solution of symmetric positive definite systems with hyperbolic rotations , 1986 .