Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 9 (1972), S. 433-437 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Among the popular and successful techniques for solving boundary-value problems for nonlinear, ordinary differential equations (ODE) are quasilinearization and the Galerkin procedure. In this note, it is demonstrated that utilizing the Galerkin criterion followed by the Newton-Raphson scheme results in the same iteration process as that obtained by applying quasilinearization to the nonlinear ODE and then the Galerkin criterion to each linear ODE in the resulting sequence. This equivalence holds for only the Galerkin procedure in the broad class of weighted-residual methods.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 8 (1971), S. 66-72 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this note, a noniterative scheme for solving two-point boundary-value problems for single and multi-input, linear constant systems is developed. The scheme requires the solution of 2n differential equations.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 11 (1973), S. 203-212 
    ISSN: 1573-2878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Through the example of Conte (Ref. 6), the Galerkin procedure with a small number (N⩽6) of low-degree polynomial modes is illustrated as a computationally rapid and effective technique for solving extremely stiff linear two-point boundary-value problems. Numerical solutions are provided for eigenvalue spreads σ ranging from 20 through 106. They agree with the exact solution to at least 2N decimal places. The errors are insensitive to the eigenvalue spread. Comparisons are made with the continuation technique of Roberts and Shipman (Ref. 1), who did not succeed in solving this example for σ=√(36,000).
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 22 (1977), S. 239-249 
    ISSN: 1573-2878
    Keywords: Weighted residual methods ; boundary-value problems ; numerical methods ; difference equations ; discrete systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The foundations, applications, and convergence properties of discrete weighted residual methods (DWRM's) are presented in Refs. 1–3. This paper serves to illustrate DWRM's for solving a sensitive nonlinear discrete boundary-value problem. The results indicate that DWRM's can be applied to provide models of increasing complexity which can then be utilized for the analysis and design of physical systems.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 8 (1974), S. 743-770 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The discrete (Legendre) orthogonal polynomials, (DLOP's) are useful for approximation purposes. This set of mth degree polynomials {Pm(K, N)} are orthogonal with unity weight over a uniform discrete interval and are completely determined by the normalization Pm(O, N) = 1. The authors are employing these polynomials as assumed modes in engineering applications of weighted residual methods. Since extensive material on these discrete orthogonal polynomials, and their properties, is not readily available, this paper is designed to unify and summarize the presently available information on the DLOP's and related polynomials. In so doing, many new properties have been derived. These properties, along with sketches of their derivation, are included. Also presented are a representation of the DLOP's as a product of vectors and matrices, and an efficient computational scheme for generating these polynomials.
    Additional Material: 5 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...