ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (4)
  • 41  (3)
  • rationality  (2)
  • 34A45  (1)
  • Springer  (4)
  • Computer Science  (4)
Collection
  • Articles  (4)
Publisher
  • Springer  (4)
Years
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 3 (1992), S. 201-209 
    ISSN: 1572-9265
    Keywords: AMS 15 ; 41 ; Orthogonal polynomials ; Laurent polynomials ; T-fractions ; Padé approximants
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper is concerned with double sequencesC={C n} n =−∞/∞ of Hermitian matrices with complex entriesC n ∈M s×s ) and formal Laurent seriesL 0(z)=−Σ k=1 ∞ C −k z k andL ∞(z)=Σ k=0 ∞ C k z −k . Making use of a Favard-type theorem for certain sequences of matrix Laurent polynomials which was obtained previously in [1] we can establish the relation between the matrix counterpart of the so-calledT-fractions and matrix orthogonal Laurent polynomials. The connection with two-point Padé approximants to the pair (L 0,L ∞) is also exhibited proving that such approximants are Hermitian too. Finally, error formulas are also given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 21 (1999), S. 185-203 
    ISSN: 1572-9265
    Keywords: systems of differential equations ; analytic solutions ; matrix Padé approximation ; rationality ; minimum degrees ; uniqueness ; partial differential equations ; 41A21 ; 34A45 ; 35A35
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we present a technique to study the existence of rational solutions for systems of differential equations — for an ordinary differential equation, in particular. The method is relatively straightforward; it is based on a rationality characterisation that involves matrix Padé approximants. It is important to note that, when the solution is rational, we use formal power series “without taking into account” their circle of convergence; at the end of this paper we justify this. We expound the theory for systems of linear first-order ordinary differential equations in the general case. However, the main ideas are applied in numerical resolution of partial differential equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 15 (1997), S. 167-192 
    ISSN: 1572-9265
    Keywords: Matrix Padé Approximation ; rationality ; minimum degrees ; uniqueness ; 65 ; 41 ; 15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In many applications it is of major interest to decide whether a given formal power series with matrix-valued coefficients of arbitrary dimensions results from a matrix-valued rational function. As the main result of this paper we provide an answer to this question in terms of Matrix Padé Approximants of the given power series. Furthermore, given a matrix rational function, the “smallest” degrees of the matrix polynomials which represent it are not necessarily unique. Therefore we study a certain minimality-type, that is, minimum degrees. We aim to obtain all the minimum degrees for the polynomials which represent the function as equivalents. In addition, given that the rational representation of the function for the same pair of degrees need not be unique, we have obtained conditions to study the uniqueness of said representation. All the results obtained are presented graphically in tables setting out the above information. They lead to a number of properties concerning special structures, staired blocks, in the Padé Table.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    ISSN: 1572-9265
    Keywords: Transfer-function model ; Padé approximation ; ε-algorithm ; 41 ; 62 ; 65 ; 90
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The aim of this paper is to apply an algorithm related to the rational approximation for the identification of the lag structure in a transfer-function model. In fact, we apply the ε-algorithm proposed by Berlinet [3–5] to determine the polynomial orders in univariate and multivariate ARMA models. Furthermore, it has been proposed by Berlinet [5], González and Cano [13, 14] and González et al. [15] for a transfer-function model with one input and multiple inputs, respectively. The main contribution in this paper concerns the study of the relative significance of the elements in the ε-algorithm table, in the same way as that given by Berlinet and Francq [7] for ARMA models, to confirm the pattern used to specify the model. Two examples will be considered, namely, the sales series M [8] and a simulated model [20]. A comparison is also made between the results of the ε-algorithm and the corner method generally used in the econometric literature. Although the ε-algorithm requires a more advanced theory in Numerical Analysis, it can be applied in a more simple way than the corner method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...