Results 271 to 280 of about 1,247,248 (314)

Solution of large weighted equicut problems

European Journal of Operational Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DELL'AMICO, Mauro, M. Trubian
openaire   +2 more sources

Parallel Solution of Large Lyapunov Equations

SIAM Journal on Matrix Analysis and Applications, 1992
The solution of large-order (\(100\leq n\leq 1000\)) Lyapunov equations \(AX+XA^ T+Q=0\) is considered. A parallel version of the Hammarling algorithm [cf. \textit{S. J. Hammerling}, IMA J. Numer. Anal. 2, 303-323 (1982; Zbl 0492.65017)] for large and dense \(A\) and a novel iterative parallel algorithm, called full-rank perturbed iteration (FRPI), for
Alan Scottedward Hodel, Kameshwar Poolla
openaire   +2 more sources

Large and entire large solutions for a class of nonlinear problems

Applied Mathematics and Computation, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nedra Belhaj Rhouma, Amor Drissi
openaire   +1 more source

LARGE STRAIN SOLUTIONS OF RUBBER COMPONENTS

Computers & Structures, 1983
Abstract A Mooney-Rivlin material model for plane strain and axisymmetric analyses of rubber has been implemented in the ADINA computer code. Using a consistent penalty method, derived from a regularized mixed formulation, the nonlinear incompressibility constraint is weakened by a properly chosen projection procedure.
Bo Häggblad, Jan Anders Sundberg
openaire   +1 more source

A practical solution for a large sparse matrix

Software: Practice and Experience, 1988
AbstractThis paper describes a computational technique that was used for determining whether a certain matrix equation, Mx = b, had an exact solution. Here, MT was a sparse 96,208 × 40,040 integer matrix. The approach is an appropriate alternative for certain matrices when memory constraints preclude using conventional techniques.
Irvin Roy Hentzel, David J. Pokrass
openaire   +1 more source

Solution of Schrödinger’s equation for large systems

Physical Review B, 1989
Iterative diagonalization of the Hamiltonian matrix is required to solve very large electronic-structure problems. Present algorithms are limited in their convergence rates at low wave numbers by stability problems associated with large changes in the Hartree potential, and at high wave numbers with large changes in the kinetic energy.
, Teter, , Payne, , Allan
openaire   +2 more sources

A minimization method for the solution of large symmetriric eigenproblems

International Journal of Computer Mathematics, 1998
This paper concerns with the solution of a special eigenvalue problem for a large sparse symmetric matrix by a fast convergent minimization method. A theoretical analysis of the method is developed; it is proved that is convergent with a convergence rate of fourth order.
GALLIGANI, Emanuele, V. RUGGIERO, ZANNI, Luca   +2 more
openaire   +1 more source

The Solution of Large Symmetric Eigenproblems by Sectioning

SIAM Journal on Numerical Analysis, 1972
When a relatively few eigenvalues are desired for a very large symmetric matrix eigenvalue problem, direct methods such as Householder reduction tend to be inefficient. Inverse iteration works reasonably well but runs into difficulties when eigenvalues are clustered.
openaire   +2 more sources

Production of large-scale peptides in solution

Biochemical Society Transactions, 1990
The production of large-scale peptides in solution has some advantages and some disadvantages. Advantages. (i) The layout of the synthesis can be planned in advance in respect of: main- and side-chain protection; fragment selection and methods of fragment coupling to minimize racemization.
openaire   +2 more sources

Process Simulation - From Large Computers and Small Solutions to Small Computers and Large Solutions

Chemical Product and Process Modeling, 2006
This paper reviews the evolution of process simulation in conjunction with the evolution of computer hardware and software technologies from a chemical engineering perspective. A brief history of this hardware evolution is presented and points to exponential growth of computing power.
William Y Svrcek, Marco A Satyro
openaire   +1 more source