2017
DOI: 10.1007/978-3-319-56932-1_24
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 38 publications
0
1
0
Order By: Relevance
“…It is important to note that the authors in [36] were the first to establish the relationship between the oscillating and semiseparable matrices while seeing one as the inverse of the other. Subsequently, this relationship has been acknowledged and referenced in numerous publications, such as [34,[37][38][39][40][41][42][43], among others.…”
Section: A Factorization To Solve Tridiagonal Systemsmentioning
confidence: 99%
“…It is important to note that the authors in [36] were the first to establish the relationship between the oscillating and semiseparable matrices while seeing one as the inverse of the other. Subsequently, this relationship has been acknowledged and referenced in numerous publications, such as [34,[37][38][39][40][41][42][43], among others.…”
Section: A Factorization To Solve Tridiagonal Systemsmentioning
confidence: 99%