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  (13)
  • Springer  (11)
  • Elsevier  (2)
  • American Chemical Society
  • Blackwell Publishing Ltd
  • 1990-1994  (13)
  • Computer Science  (13)
Collection
  • Articles  (13)
Publisher
Years
Year
  • 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 3 (1992), S. 211-222 
    ISSN: 1572-9265
    Keywords: Weight function ; integration rules ; extrapolation methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper quadrature rules introduced by Jagerman [1] and Stetter [2] are considered and asymptotic expansions for the error given. This allows to make use of the Romberg extrapolation process. Such rules can be viewed as generalizations of the well-known mid-point rule. Thus, numerical examples comparing these rules are finally presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 6 (1992), S. 219-240 
    ISSN: 1573-0409
    Keywords: Force control ; slip-stick friction ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract This paper explores two practical issues related to the force control of manipulators. The first issue examined is how system stability is effected by commonly occurring manipulator nonlinearities, such as sampled-data, control signal saturation and slip-stick friction. It is shown that discretely implemented force control algorithms can drive the feedback force controlled manipulator into a limit cycle, even for a very small sampling period that by far satisfies Shannon's sampling theorem. The bounds of stability are enhanced by the presence of control signal saturation and slip stick friction. The second issue investigated is the inclusion of a high gain inner position loop as a means to minimize the unpredictability in the steady state error due to slip-stick friction. In order to support the theoretical conclusions, experiments were performed with the PUMP 560 industrial robot testbed facility developed at Colorado State University.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 5 (1990), S. 11-42 
    ISSN: 1432-0541
    Keywords: Approximation algorithms ; Partition of rectilinear polygons ; Polynomial-time complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetR be a rectangle and letP be a set of points located insideR. Our problem consists of introducing a set of line segments of least total length to partition the interior ofR into rectangles. Each rectangle in a valid partition must not contain points fromP as interior points. Since this partitioning problem is computationally intractable (NP-hard), we present efficient approximation algorithms for its solution. The solutions generated by our algorithms are guaranteed to be within three times the optimal solution value. Our algorithm also generates solutions within four times the optimal solution value whenR is a rectilinear polygon. Our algorithm can be generalized to generate good approximation solutions for the case whenR is a rectilinear polygon, there are rectilinear polygonal holes, and the sum of the length of the boundaries is not more than the sum of the length of the edges in an optimal solution.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    ISSN: 1572-9265
    Keywords: Primary ; 42C05 ; Secondary ; 30D50 ; 41A20 ; 41A55 ; Rational interpolation ; orthogonal functions ; Szegö theory ; Pick-Nevanlinna interpolation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We shall consider nested spacesl n ,n = 0, 1, 21... of rational functions withn prescribed poles outside the unit disk of the complex plane. We study orthogonal basis functions of these spaces for a general positive measure on the unit circle. In the special case where all poles are placed at infinity,l n =∏ n , the polynomials of degree at mostn. Thus the present paper is a study of orthogonal rational functions, which generalize the orthogonal Szegö polynomials. In this paper we shall concentrate on the functions of the second kind which are natural generalizations of the corresponding polynomials.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 3 (1992), S. 105-116 
    ISSN: 1572-9265
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we shall be concerned with the problem of approximating the integralI μ{f}=∫ −π π f(eiθ) dμ(θ), by means of the formulaI n {f}=Σ j=1 n A j (n) f(x j (n) ) where μ is some finite positive measure. We want the approximation to be so thatI n{f}=I μ{f} forf belonging to certain classes of rational functions with prescribed poles which generalize in a certain sense the space of polynomials. In order to get nodes {x j (n) } of modulus 1 and positive weightsA j (n) , it will be fundamental to use rational functions orthogonal on the unit circle analogous to Szegő polynomials.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 3 (1992), S. 117-124 
    ISSN: 1572-9265
    Keywords: Formal Laurent series ; Padé approximants ; Chebyshev series ; generating polynomial
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Rational approximants, in the Padé sense, to a given formal Laurent series,F(z)=Σ −∞ ∞ c k z k , have been considered by several authors (see [3] for a survey about the different kinds of approximants which can be defined). In this paper, we shall be concerned with symmetric series, that is, when the complex coefficients {c k } −∞ +∞ satisfyc −k=c k,k=0, 1,.... Making use of Brezinski's approach [1], for Padé-type approximation to a formal power series, rational approximants toF(z) with prescribed poles are obtained, and their algebraic properties considered. These results will allow us to give an alternative approach for the Padé-Chebyshev approximants.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1572-9265
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider forn=0, 1,... the nested spaces ℒ n of rational functions of degreen at most with given poles $$1/\bar \alpha _i , |\alpha _i |〈 1, i = 1,...,n$$ . Given a finite measure supported on the unit circle, we associate with it a nested orthogonal basis of rational functions Φ0,...,Φ n for ℒ n ,n=0, 1,.... These Φ n satisfy a recurrence relation that generalizes the recurrence for Szegő polynomials. In this paper we shall prove a Favard type theorem which says that if one has a sequence of rational functions Φ n ∈ ℒ n which are generated by such a recurrence, then there will be a measure μ supported on the unit circle to which they are orthogonal. We shall give a sufficient condition for the uniqueness of this measure.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 3 (1992), S. 91-104 
    ISSN: 1572-9265
    Keywords: primary 30E05 ; Moment problem ; orthogonal rational functions ; quasi-definite ; positive-definite ; Hermitian functional
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Leta 1,...,a p be distinct points in the finite complex plane ℂ, such that |a j|〉1,j=1,..., p and let $$b_j = 1/\bar \alpha _j ,$$ j=1,..., p. Let μ0, μ π (j) , ν π (j) j=1,..., p;n=1, 2,... be given complex numbers. We consider the following moment problem. Find a distribution ψ on [−π, π], with infinitely many points of increase, such that $$\begin{array}{l} \int_{ - \pi }^\pi {d\psi (\theta ) = \mu _0 ,} \\ \int_{ - \pi }^\pi {\frac{{d\psi (\theta )}}{{(e^{i\theta } - a_j )^n }} = \mu _n^{(j)} ,} \int_{ - \pi }^\pi {\frac{{d\psi (\theta )}}{{(e^{i\theta } - b_j )^n }} = v_n^{(j)} ,} j = 1,...,p;n = 1,2,.... \\ \end{array}$$ It will be shown that this problem has a unique solution if the moments generate a positive-definite Hermitian inner product on the linear space of rational functions with no poles in the extended complex plane ℂ* outside {a 1,...,a p,b 1,...,b p}.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 3 (1992), S. 235-244 
    ISSN: 1572-9265
    Keywords: AMS 65D ; 33C ; Neumann series ; Bessel functions ; Padé approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetJ n (z) be the Bessel function of the first kind and ordern, and letf(z) be an analytic function in|z|≤r (r〉0); then it is known that the Bessel expansion $$f(z) = \sum\limits_{n = 0}^\infty {a_n J_n (z) (Neumann series)} $$ converges for|z|≤r. In this paper, we shall be concerned with the construction of “approximating” functions to (1) which are easily computable (rational functions). Namely, making use of the generating function for the family {J n (z)}, a rational functionf k (z) with prescribed poles can be obtained such thatf k (z) “approximates” tof(z) in the following sense: $$f_k (z) = \sum\limits_{n = 0}^\infty {\bar a_n J_n (z)} with \bar a_n = a_n , n = 0,1,...,k - 1;$$ and it will be said thatf k is an “approximant” of orderk. When orthogonality conditions with respect to a linear functional defined from the sequence {a n} are used, then the order of approximation may be increased up to2k. An algebraic approach of these approximants is carried out.
    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...