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  (5)
  • 41A21  (2)
  • numerical solutions  (2)
  • 34A45
  • rationality
  • Springer  (5)
  • Mathematics  (5)
  • Computer Science  (3)
  • 1
    ISSN: 1572-9265
    Keywords: multipoint Padé-type approximation ; orthogonal rational functions ; quadrature formula ; 41A21 ; 30E05 ; 41A55
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study the convergence of rational interpolants with prescribed poles on the unit circle to the Herglotz-Riesz transform of a complex measure supported on [−π, π]. As a consequence, quadrature formulas arise which integrate exactly certain rational functions. Estimates of the rate of convergence of these quadrature formulas are also included.
    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
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 93 (1997), S. 491-515 
    ISSN: 1573-2878
    Keywords: Production schedule ; scheduling problems ; quasivariational inequalities ; Bellman equation ; numerical solutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we deal with the numerical solution of the optimal scheduling problem in a multi-item single machine. We develop a method of discretization and a computational procedure which allows us to compute the solution in a short time and with a precision of order k, where k is the discretization size. In our method, the nodes of the triangulation mesh are joined by segments of trajectories of the original system. This special feature allows us to obtain precision of order k, which is in general impossible to achieve by usual methods. Also, we develop a highly efficient algorithm which converges in a finite number of steps.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 79 (1993), S. 183-195 
    ISSN: 1573-2878
    Keywords: Obstacle problem ; fast algorithms ; numerical solutions ; variational inequalities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The purpose of this paper is to present a fast algorithm for the numerical solution of the one-dimensional obstacle problem. It is proven that the algorithm converges in a finite number of steps; application examples showing its efficiency are presented.
    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...