Engineering topics
Publications and source records attributed to Ford, W. F..
In this paper, we shall give a characterization of all monotonically decreasing sequence of positive terms, whose sum converge and then introduce a Transformation which can be used to accelerate the convergence of a large class of logarithmically convergent series.
A general approach to the construction of convergence acceleration methods for vector sequence is proposed. Using this approach, one can generate some known methods, such as the minimal polynomial extrapolation, the reduced rank extrapolation, and the topological epsilon algorithm, and also some new ones. Some of the new methods are easier to implement than the known methods and are observed to have similar numerical properties. The convergence analysis of these new methods is carried out, and it is shown that they are especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iterative. A stability analysis is also given, and numerical examples are provided. The convergence and stability properties of the topological epsilon algorithm are likewise given.
A general approach to the construction of convergence acceleration methods for vector sequence is proposed. Using this approach, one can generate some known methods, such as the minimal polynomial extrapolation, the reduced rank extrapolation, and the topological epsilon algorithm, and also some new ones. Some of the new methods are easier to implement than the known methods and are observed to have similar numerical properties. The convergence analysis of these new methods is carried out, and it is shown that they are especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iteratively. A stability analysis is also given, and numerical examples are provided. The convergence and stability properties of the topological epsilon algorithm are likewise given.
As part of a continuing program of numerical tests of convergence accelerators, the iterated Aitken's Delta-squared method, Wynn's epsilon algorithm, Brezinski's theta algorithm, and Levin's u transform are compared on a broad range of test problems: linearly convergence alternating, monotone, and irregular-sign series, logarithmically convergent series, power method and Bernoulli method sequences, alternating and monotone asymptotic series, and some perturbation series arising in applications. In each category either the epsilon algorithm or the u transform gives the best results of the four methods tested. In some cases differences among methods are slight, and in others they are quite striking.
A general approach to the construction of accelerated convergence methods for vector sequences is proposed. A simplified version of minimal polynomial extrapolation is emphasized. The convergence of this method is analyzed and it is shown that it is especially suitable for accelerating the convergence of vector sequences that are obtained when one solves linear systems of equations iteratively.
Structured programming language has been given new features and some limitations are removed. Language runs more efficiently, and concepts of top down development and modularity are extended to task management.
Eleven different methods for accelerating convergence of sequences and series have been tested and compared on a wide range of test problems, including both linearly and logarithmically convergent series, monotone and alternating series. All but one of these methods are already in the literature, and they include both linear and nonlinear methods. The only methods found to accelerate convergence across the board were the u and v transforms of Levin and the theta algorithm of Brezinski. The paper gives detailed comparisons of all the tested methods on the basis of number of correct digits in the answer as a function of number of terms of the series used. A theorem of Germain-Bonne states that methods of a certain form which are exact on geometric series will accelerate linear convergence. The theorem applies to theta sub 2, and we have extended it to apply to Levin's transforms. No corresponding theorem is known for logarithmic convergence, but u, v, and theta are exact on certain large classes of logarithmic series, and all tested methods lacking this property failed to accelerate some logarithmically convergent series.
Extensions and improvements were made to SFTRAN, a structured programming language. This language was implemented as a precompiler that translates from SFTRAN to FORTRAN. It was available to batch and conversational users of the UNIVAC 1100 computer system. The SFTRAN language and its use are described. In addition, conversational time-sharing system command subroutines were implemented that eliminated the complications of dealing with extra files and processing steps that the use of a precompiler would otherwise require. These command subroutines are reported, and their use is illustrated by examples.
Extension and improvements made to SFTRAN, a structured-programming language are discussed. This improved language is implemented as a precompiler that translates from SFTRAN to FORTRAN. The SFTRAN language and its use are described. Time-Sharing System (TSS) command procedures were implemented that eliminate the complications of dealing with extra files and processing steps which the use of a precompiler would otherwise require. These command procedures are described and their use is illustrated by examples.
A connection is established between Ullah's new method of angular-momentum projection and the conventional Hill-Wheeler method. They are studied for the case where series truncation of some sort is required. It is shown that for a particular choice of angles, the analysis simplifies greatly and at the same time leads to reduced truncation error.
The renormalized Brueckner-Hartree-Fock (RBHF) theory for many-body nuclear systems has been generalized to permit calculations for intrinsic states having permanent deformation. Both Hartree-Fock and Brueckner self-consistencies are satisfied, and details of the numerical techniques are discussed. The Hamada-Johnston interaction is used in a study of deformations, binding, size, and separation energies for several nuclei. Electromagnetic transition rates, moments, and electron scattering form factors are calculated using nuclear wave functions obtained by angular momentum projection. Comparison is made to experiment as well as to predictions of ordinary and density-dependent Hartree-Fock theory.
The Brueckner-Hartree-Fock (BHF) method has been applied to nuclei whose intrinsic structure is nonspherical. Reaction matrix elements were calculated as functions of starting energy for the Hamada-Johnston interaction using the Pauli operator appropriate to O-16 and a shifted oscillator spectrum for virtual excited states. Binding energies, single particle energies, radii, and shape deformations of the intrinsic state, in ordinary as well as renormalized BHF, are discussed and compared with previous HF studies and with experiment when possible. Results are presented for C-12, 0-16 and Ne-20. It is found that the binding energies and radii are too small, but that separation energies are well reproduced when the renormalized theory is used.
A scheme is introduced which makes it feasible to make completely self-consistent Brueckner-Hartree-Fock (BHF) and renormalized BHF calculations for spherical, closed-shell and axially-symmetric deformed nuclei. The usual requirement or orbital self-consistency has been imposed, as well as self-consistency in the starting energies and occupation probabilities. Previously, only approximate forms were used for the Pauli operator. This approximation is removed and a method for making the necessary Pauli corrections to the reaction matrix during the approach to self-consistency is presented. A discussion of the symmetries which reduce the problem to one of manageable proportions is included.
The renormalized Brueckner-Hartree-Fock (RBHF) theory for many-body nuclear systems is generalized to permit calculations for intrinsic states having permanent deformation. Both Hartree-Fock and Brueckner self-consistencies are satisfied, and details of the numerical techniques are discussed. The Hamada-Johnston interaction is used in a study of deformations, binding, size, and separation energies for several nuclei. Electromagnetic transition rates, moments, and electron scattering form factors are calculated using nuclear wave functions obtained by angular momentum projection. Comparison is made to experiment as well as to predictions of ordinary and density-dependent Hartree-Fock Theory.
Explore the source record for details and available documents.
Microscopic coupled-channel analysis of proton inelastic scattering from neon and magnesium ions
Effects of altering truncated basis space used in Hartree Fock model for light deformed nuclei
FORTRAN 4 subroutines for coupling coefficients and matrix elements in quantum mechanical theory of angular momentum