Computations with infinite Toeplitz matrices and polynomials
暂无分享,去创建一个
[1] Alexandre Ostrowski. Recherches sur la méthode de graeffe et les zéros des polynomes et des séries de laurent , 1940 .
[2] L. Kantorovich,et al. Functional analysis in normed spaces , 1952 .
[3] Henryk Minc,et al. On the Matrix Equation X′X = A , 1962, Proceedings of the Edinburgh Mathematical Society.
[4] G. Baxter,et al. An explicit inversion formula for finite-section Wiener-Hopf operators , 1964 .
[5] Polynomial factorization and the Q-D algorithm , 1968 .
[6] G. Wilson. Factorization of the Covariance Generating Function of a Pure Moving Average Process , 1969 .
[7] A. Householder. The numerical treatment of a single nonlinear equation , 1970 .
[8] Gwilym M. Jenkins,et al. Time series analysis, forecasting and control , 1972 .
[9] Karl Johan Åström,et al. A numerical method for the evaluation of complex integrals , 1970 .
[10] I. Gohberg,et al. Convolution Equations and Projection Methods for Their Solution , 1974 .
[11] Henry C. Thacher,et al. Applied and Computational Complex Analysis. , 1988 .
[12] D. Heller. Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems , 1976 .
[13] Dante C. Youla,et al. Bauer-type factorization of positive matrices and the theory of matrix polynomials orthogonal on the unit circle , 1978 .
[14] Marcel F. Neuts,et al. Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .
[15] S. Barnett. Polynomials and linear control systems , 1983 .
[16] Jan Jezek. Conjugated and symmetric polynomial equations. I. Continuous-time systems , 1983, Kybernetika.
[17] G. Rota. Hankel and toeplitz matrices and forms: I. S. Iohvidov. Birkhaüser, Basel, 1982, 231 pp. , 1983 .
[18] Gene H. Golub,et al. Matrix computations , 1983 .
[19] A. Bultheel. Zeros of a rational function defined by its Laurent expansion , 1984 .
[20] Georg Heinig,et al. Algebraic Methods for Toeplitz-like Matrices and Operators , 1984 .
[21] Victor Y. Pan,et al. Polynomial division and its computational complexity , 1986, J. Complex..
[22] An analysis of the method of L. Fox and L. Hayes for the factorization of a polynomial , 1987 .
[23] V. Ramaswami. A stable recursion for the steady state vector in markov chains of m/g/1 type , 1988 .
[24] Marcel F. Neuts,et al. Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .
[25] J. Engwerda. On the existence of a positive definite solution of the matrix equation X + A , 1993 .
[26] W. Gragg,et al. On Singular Values of Hankel Operators of Finite Rank , 1989 .
[27] Clifford T. Mullis,et al. The Euclid algorithm and the fast computation of cross-covariance and autocovariance sequences , 1989, IEEE Trans. Acoust. Speech Signal Process..
[28] W. Gragg,et al. Numerical experience with a superfast real Toeplitz solver , 1989 .
[29] T. D. Morley,et al. Positive solutions to X = A−BX-1 B∗ , 1990 .
[30] Clifford T. Mullis,et al. A Newton-Raphson method for moving-average spectral factorization using the Euclid algorithm , 1990, IEEE Trans. Acoust. Speech Signal Process..
[31] A. Ran,et al. Necessary and sufficient conditions for the existence of a positive definite solution of the matrix equation X + A*X-1A = Q , 1993 .
[32] Vaidyanathan Ramaswami,et al. A logarithmic reduction algorithm for quasi-birth-death processes , 1993, Journal of Applied Probability.
[33] Dietmar Wagner,et al. Analysis of a multi-server delay-loss system with a general Markovian arrival process , 1994 .
[34] P. Dooren. Some numerical challenges in control theory , 1994 .
[35] Victor Y. Pan,et al. Fundamental Computations with Polynomials , 1994 .
[36] Dario Bini,et al. On Cyclic Reduction Applied to a Class of Toeplitz-Like Matrices Arising in Queueing Problems , 1995 .
[37] Dario Bini,et al. Fast Parallel Computation of the Polynomial Remainder Sequence Via Bezout and Hankel Matrices , 1995, SIAM J. Comput..
[38] Ali H. Sayed,et al. Displacement Structure: Theory and Applications , 1995, SIAM Rev..
[39] J. Hillston. Compositional Markovian Modelling Using a Process Algebra , 1995 .
[40] G. W. Stewart,et al. On the solution of block Hessenberg systems , 1992, Numer. Linear Algebra Appl..
[41] B. Levy,et al. Hermitian solutions of the equation X = Q + NX−1N∗ , 1996 .
[42] P. Fuhrmann. A Polynomial Approach to Linear Algebra , 1996 .
[43] Raymond H. Chan,et al. Conjugate Gradient Methods for Toeplitz Systems , 1996, SIAM Rev..
[44] Hans J. Stetter. Analysis of zero clusters in multivariate polynomial systems , 1996, ISSAC '96.
[45] Plamen Y. Yalamov,et al. Stability of the block cyclic reduction , 1996 .
[46] Xingzhi Zhan,et al. On the matrix equation X + ATX−1A = I , 1996 .
[47] Victor Y. Pan,et al. Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors , 1996, J. Complex..
[48] Beatrice Meini,et al. On the Solution of a Nonlinear Matrix Equation Arising in Queueing Problems , 1996, SIAM J. Matrix Anal. Appl..
[49] Xingzhi Zhan,et al. Computing the Extremal Positive Definite Solutions of a Matrix Equation , 1996, SIAM J. Sci. Comput..
[50] Beatrice Meini,et al. An improved FFT-based version of Ramaswami's formula , 1997 .
[51] Victor Y. Pan,et al. Solving a Polynomial Equation: Some History and Recent Progress , 1997, SIAM Rev..
[52] Victor Y. Pan,et al. The structure of sparse resultant matrices , 1997, ISSAC.
[53] H. R. Gail,et al. Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains , 1997, Advances in Applied Probability.
[54] Giuseppe Anastasi,et al. Performance Evaluation of a Worst Case Model of the MetaRing MAC Protocol With Global Fairness , 1997, Perform. Evaluation.
[55] Marc Van Barel,et al. Computing the Zeros of Analytic Functions , 2000 .
[56] Charles A. Micchelli,et al. Spectral factorization of Laurent polynomials , 1997, Adv. Comput. Math..
[57] Luciano Lenzini,et al. An efficient numerical method for performance analysis of contention MAC protocols: a case study (PRMA++) , 1998, IEEE J. Sel. Areas Commun..
[58] Beatrice Meini,et al. Solving M/G/1 type Markov chains: recent advances and applications , 1998 .
[59] L. Brugnano,et al. Solving differential problems by multistep initial and boundary value methods , 1998 .
[60] Beatrice Meini,et al. Using displacement structure for solving Non-Skip-Free M/G/1 type Markov chains , 1998 .
[61] Giovanni Manzini,et al. Inversion of circulant matrices over Zm , 1998, Math. Comput..
[62] Chun-Hua Guo,et al. Newton's Method for Discrete Algebraic Riccati Equations when the Closed-Loop Matrix Has Eigenvalues on the Unit Circle , 1999, SIAM J. Matrix Anal. Appl..
[63] A. Böttcher,et al. Introduction to Large Truncated Toeplitz Matrices , 1998 .
[64] A. Böttcher,et al. Convergence speed estimates for the norms of the inverses of large truncated Toeplitz matrices , 1999 .
[65] Beatrice Meini,et al. Fast algorithms for structured problems with applications to Markov chains and queueing models , 1999 .
[66] Beatrice Meini,et al. Solving block-banded block Toeplitz systems with banded Toeplitz blocks , 1999, Optics & Photonics.
[67] Beatrice Meini,et al. Effective Methods for Solving Banded Toeplitz Systems , 1999, SIAM J. Matrix Anal. Appl..
[68] Chun-Hua Guo,et al. Iterative solution of two matrix equations , 1999, Math. Comput..
[69] Vaidyanathan Ramaswami,et al. Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.
[70] Thomas Kailath,et al. Fast reliable algorithms for matrices with structure , 1999 .
[71] Beatrice Meini,et al. A new algorithm for the design of finite capacity service units , 1999 .
[72] Arnold Schönhage. Variations on computing reciprocals of power series , 2000, Inf. Process. Lett..
[73] Quadratically convergent algorithms for solving matrix polynomial equations , 2000 .
[74] Sidney L. Hantler,et al. Use of Characteristic Roots for Solving Infinite State Markov Chains , 2000 .
[75] N. Higham,et al. Numerical analysis of a quadratic matrix equation , 2000 .
[76] Beatrice Meini,et al. Regularized solution of block-banded block Toeplitz systems , 2000, SPIE Optics + Photonics.
[77] Victor Y. Pan,et al. Multivariate Polynomials, Duality, and Structured Matrices , 2000, J. Complex..
[78] Luca Gemignani,et al. Efficient and stable solution of structured Hessenberg linear systems arising from difference equations , 2000 .
[79] Luca Gemignani,et al. Computing a Hurwitz factorization of a polynomial , 2000 .
[80] Polynomial factors, lemniscates and structured matrix technology , 2001 .
[81] Eugene E. Tyrtyshnikov,et al. Structured matrices: recent developments in theory and computation , 2001 .
[82] Beatrice Meini,et al. Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations , 1998, Numerische Mathematik.
[83] Gregorio Malajovich,et al. Tangent Graeffe iteration , 2001, Numerische Mathematik.
[84] Twenty old and new asymptotic results on Toeplitz band matrices , 2001 .
[85] Beatrice Meini,et al. Solving block banded block Toeplitz systems with structured blocks: algorithms and applications , 2001 .
[86] Beatrice Meini,et al. Approximate displacement rank and applications , 2001 .
[87] Giovanni Manzini,et al. Inversion of circulant matrices over Zm , 2001, Math. Comput..
[88] Beatrice Meini,et al. Efficient computation of the extreme solutions of X + A*X-1A = Q and X - A*X-1A = Q , 2001, Math. Comput..
[89] Beatrice Meini,et al. Improved cyclic reduction for solving queueing problems , 1997, Numerical Algorithms.