Parallel Algorithms for Evaluating Matrix Polynomials
Abstract
References
Recommendations
On the relation between Hurwitz stability of matrix polynomials and matrix-valued Stieltjes functions
AbstractIn this paper, we elaborate on the relationship between the Hurwitz stability of matrix polynomials and matrix-valued Stieltjes functions. Our strategy is that, for a monic matrix polynomial, we associate a rational matrix-valued ...
Parallel Algorithms to Evaluate Orthogonal Polynomial Series
In this paper four parallel algorithms for the evaluation of finite series of orthogonal polynomials are introduced. The algorithms are based on the Forsythe and Clenshaw sequential algorithms. Several tests carried out on a Cray T3D are presented.
Ratio Asymptotics for Orthogonal Matrix Polynomials with Unbounded Recurrence Coefficients
We study ratio asymptotic behaviour for orthogonal matrix polynomials with unbounded recurrence coefficients.
Comments
Information & Contributors
Information
Published In
In-Cooperation
- University of Tsukuba: University of Tsukuba
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Funding Sources
- Israel Science Foundation
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 112Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in