119056020
Solving quadratic lambda-matrix problems without factorization
An algorithm is presented for computing the eigenvalues of smallest magnitude and their associated eigenvectors of the quadratic lambda-matrix M lambda/sup 2/ + C lambda + K. M, C, and K are assumed to be symmetric matrices with K positive definite and M negative definite. The algorithm is based on a generalization of the Rayleigh quotient and the Lanczos method for computing eigenpairs of standard symmetric eigenproblems. Monotone quadratic convergence to the smallest positive and negative eigenvalue is proved. Test examples are presented.
5786909
The QR algorithm and Hyman’s method on vector computers
The implementation on vector computers of the QR algorithm and of iterative schemes based on obtaining the determinant and its derivatives by Hyman's method are presented. It is shown that iterative schemes based on Hyman's method will probably be more efficient than the QR algorithm on vector computers for large matrices. A theoretical comparison of the Laguerre iterative scheme with the QR algorithm is presented using the latest available CDC STAR-100 instruction execution times. In addition, the results of several test cases run on the Laguerre-Hyman algorithm on a serial computer are reported.
57087721
EZVIDEO, FORTRAN graphics routines for the IBM AT
A set of IBM PC-based FORTRAN plotting routines called EZVIDEO is described in this report. These routines are written in FORTRAN and can be called from FORTRAN programs. EZVIDEO simulates a subset of the well-known DISSPLA graphics calls and makes plots directly on the IBM AT display screen. Screen dumps can also be made to an attached LaserJet or Epson printer to make hard copy without using terminal emulators. More than forty DISSPLA calls are simulated by the EZVIDEO routines. Typical screen plots require about 10 seconds (s), and good hard copy of the screen image on a laser printer requires less than 2 minutes (min). This higher-resolution hard copy is adequate for most purposes because of the enhanced resolution of the screen in the EGA and VGA modes. These EZVIDEO routines give the IB, AT user a stand-alone capability to make useful scientific or engineering plots directly on the AT, using data generated in FORTRAN programs. The routines will also work on the IBM PC or XT in CGA mode, but they require more time and yield less resolution. 7 refs., 4 figs.
122864423
Numerical Computation of the Matrix Exponential with Accuracy Estimate
This paper presents and analyzes an algorithm for computing the exponential of an arbitrary $n \times n$ matrix. Diagonal Pade table approximations are used in conjunction with several techniques for reducing the norm of the matrix. An important feature of the algorithm is that an estimate for the minimum number of digits accurate in the norm of the computed exponential matrix is returned to the user. In obtaining this estimate, several interesting results concerning rounding errors and Pade approximations are presented.
120828253
Balancing the Generalized Eigenvalue Problem
An algorithm is presented for balancing the A and B matrices prior to computing the eigensystem of the generalized eigenvalue problem $Ax = \lambda Bx$. The three-step algorithm is specifically designed to precede the $QZ$-type algorithms, but improved performance is expected from most eigensystem solvers. Permutations and two-sided diagonal transformations are applied to A and B to produce matrices with certain desirable properties. Test cases are presented to illustrate the improved accuracy of the computed eigenvalues.
120013608
Computing the singular value decompostion of a product of two matrices
An algorithm is developed for computing the singular value decomposition of a product of two general matrices without explicitly forming the product. The algorithm is based on an earlier Jacobi-like method due to Kogbetliantz and uses plane rotations applied to the two matrices separately. A triangular variant of the basic algorithm is developed that reduces the amount of work required.
121961363
Two Yang-Mills-Higgs monopoles close together
Abstract A procedure for constructing a seven-parameter family of Yang-Mills-Higgs multipopole e solutions is presented. Each solution represents a separated 2-monopole configuration. The distance between the monopoles is restricted to be less than a certain positive number, in the sense that the solutions are not known to be smooth for greater distances.
119362341
Hopf solitons on the lattice
Hopf solitons in the Skyrme?Faddeev model?S2-valued fields on with Skyrme dynamics?are string-like topological solitons. In this letter, we investigate the analogous lattice objects for S2-valued fields on the cubic lattice with a nearest-neighbour interaction. For suitable choices of the interaction, topological solitons exist on the lattice. Their appearance is remarkably similar to that of their continuum counterparts, and they exhibit the same power-law relation E ? cH3/4 between the energy E and the Hopf number H.
2886070
Topological Q-solitons
Static topologically-nontrivial configurations in sigma-models, for spatial dimension D⩾2, are unstable. The question addressed here is whether such sigma-model solitons can be stabilized by steady rotation in internal space; that is, rotation in a global SO(2) symmetry. This is the mechanism which stabilizes Q-balls (nontopological solitons). The conclusion is that the Q-mechanism can stabilize topological solitons in D=2 spatial dimensions, but not for D=3.
8637389
Stability of sigma-model strings and textures
In flat spacetime, sigma-model strings and textures are both unstable: they tend to collapse (and subsequently decay). With sufficient cosmological expansion, however, they are stable in a generalized sense: a small perturbation will cause them to change their shape, but they do not decay. The current rate of expansion is sufficient to stabilize strings, but not textures.
120434886
Generalized Nahm equations and classical Yang-Baxter equations
Abstract The Nahm equations for the three matrices T j (t), namely T j = 1 2 ϵ jkl [T k , T l ] , are generalized to set of equations involving more than three matrices. This generalization is closely linked to the classical Yang-Baxter equations. It seems to be “completely integrable” in the same sense that Nahm's equations are.