The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 6493 of Mathematical Reviews Vol. , Issue 89K
[page]
1989
Mathematical Reviews
Preserved Fulltext
(I-CLBR-SS)
Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation.
Math. Programming 42 (1988), no. 2 (Ser. B), 375-389. ...
An algorithm is then presented for the cone problem and finally re- sults are presented for a small numerical comparison between the proposed algorithm and Lemke’s algorithm. ...
Solution of Linear and Non-Linear Boundary Value Problems Using Population-Distributed Parallel Differential Evolution
2019
Journal of Artificial Intelligence and Soft Computing Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The numerical results demonstrate that the algorithm is quite accurate and efficient for solving 2nd-order, 2-point BVPs. ...
Meanwhile, the statistical analysis is provided to discover the effect of parametric changes such as an increase in population individuals and nodes representing features on the quality and behavior of ...
The trial vector t t t 01 competes with vector 1 1 1 of the population based on fitness value on processor 1 1 1. t t t 02 competes against vector no. 2 2 2 of the population on processor number 2 2 2. ...
doi:10.2478/jaiscr-2019-0004
fatcat:qyvv73csizfn7k6bfi5buf7ibm
Fast computing of velocity field for flows in industrial burners and pumps
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
are numerically resolved using a set of computations distributed among the available processors. ...
At first the partial differential equations are translated into a set of nonlinear ordinary differential equations using the geometrical shape of the domain where the flow is developing, then these ODEs ...
This work has been executed as section of a research project, supported by Italian Ministry for Scientific Research and University, on optimized flows in combustion chambers and pumps, and based on a collaboration ...
arXiv:0707.1490v1
fatcat:lnfmurxwwjcwjjuy5ek3nuirq4
Techniques in Computational Stochastic Dynamic Programming
[chapter]
1996
Control and Dynamic Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The numerical approach directly treats the partial differential equation of stochastic dynamic programming. ...
Shoemaker [79, 16, 24, 25] and coworkers have applied several variants of the deterministic differential dynamic programming algorithm groundwater applications. ...
However, the same methods must be used on both linear comparison and nonlinear equations so the derivation of the corrector convergence criterion for the linear comparison equation is valid for the nonlinear ...
doi:10.1016/s0090-5267(96)80017-x
fatcat:7mtk4gtcmfhippn72sjnnox5ke
DC Large-Scale Simulation of Nonlinear Circuits on Parallel Processors
2012
International Journal of Electronics and Telecommunications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Newton-Raphson DC analysis of large-scale nonlinear circuits may be an extremely time consuming process even if sparse matrix techniques and bypassing of nonlinear models calculation are used. ...
This paper presents a theoretical foundation of the algorithm, its implementation, and numerical complexity analysis in virtue of practical measurements of matrix operations. ...
Both versions are executed on the same available processor, simulation times, t serial and t parallel , are measured for several combinations of n s and n 0 , and a practical figure of merit η p = t serial ...
doi:10.2478/v10177-012-0040-4
fatcat:mpotzqtisbh7lhyrmukn44aoaa
Parallel processing for transient nonlinear structural dynamics of three-dimensional framed structures using domain decomposition
1988
Computers & structures
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Concerns include long-duration dynamic loading, geometric and material nonlinearity, and the wide distribution of vibrational frequencies found in frame models. ...
The implicit domain decomposition method described employs substructuring techniques and then a preconditioned conjugate gradient algorithm for the iterative solution of the reduad set of unknowns along ...
The slowest processor controls the total speed of the algorithm, and it is the times T, for the slowest processor which are presented and used for comparison here. ...
doi:10.1016/0045-7949(88)90189-7
fatcat:msxpuh7fcng23gzbdz3bx2z4hy
Parallel dynamic programming for optimal experiment design in nonlinear systems
2016
2016 IEEE 55th Conference on Decision and Control (CDC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We present a method of computing optimal input trajectories for parameter estimation in nonlinear dynamical systems using dynamic programming. ...
We implement this algorithm in the Julia programming language, and exploit parallelism to increase computation speed. ...
Distributing this task to multiple processors can then be handled automatically by the programming environment. ...
doi:10.1109/cdc.2016.7798700
dblp:conf/cdc/MaidensPA16
fatcat:pe4ksqqbtzdkvivpihcwsk23tm
Domain decomposition methods for circuit simulation
1994
Proceedings of the eighth workshop on Parallel and distributed simulation - PADS '94
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This coarse grain parallelization guarantees a minimum of communication and thus achieves good speedup results on a workstation cluster. our results show that with a cluster of ten powerful RISC workstations ...
On a cluster of 27 workstations we succeeded in simulating a circuit with 135000 transistors, while we failed to simulate the same circuit on our supercomputer because of a lack of memory. ...
Domain Decomposition Many numerical algorithms such as those used in fluid dynamics, finite element methods and ordinary differential equations ultimately result in solving large sparse linear systems. ...
doi:10.1145/182478.182588
fatcat:uctol66u5vf6pap6mar4tz67e4
Domain decomposition methods for circuit simulation
1994
ACM SIGSIM Simulation Digest
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
This coarse grain parallelization guarantees a minimum of communication and thus achieves good speedup results on a workstation cluster. our results show that with a cluster of ten powerful RISC workstations ...
On a cluster of 27 workstations we succeeded in simulating a circuit with 135000 transistors, while we failed to simulate the same circuit on our supercomputer because of a lack of memory. ...
Domain Decomposition Many numerical algorithms such as those used in fluid dynamics, finite element methods and ordinary differential equations ultimately result in solving large sparse linear systems. ...
doi:10.1145/195291.182588
fatcat:hl6lfinugzhipiegrsopka6fxy
Accelerating relaxation algorithms for circuit simulation using waveform-Newton and step-size refinement
1990
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The method is based on using an iterative step-size refinement strategy with a waveform-relaxation-Newton (WRN) algorithm. ...
Finally, it is shown that the step-refined WRN algorithm can be implemented on a parallel processor in such a way that not only can different subsystems be processed in parallel but, in addition, the solution ...
certain features that can be exploited on parallel processors and this aspect provides an additional advantage over other methods. We would like to thank Ken Kundert, Prof. 0. Nevanlinna, F. ...
doi:10.1109/43.59071
fatcat:nxwxdzwt2naovarxlar44laruu
Implementing an ODE code on distributed memory computers
1994
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The approach taken is based on waveform relaxation in which the problem is decomposed into a sequence of subproblems which are then solved independently using VODE on each processor. ...
In this paper, it is shown how to adapt an existing package (VODE) for solving systems of ordinary differential equations on serial computers to distributed memory parallel computers. ...
The speedup results are obtained by comparing the times taken by VODE running on one processor in serial mode and our code running on 32 processors. ...
doi:10.1016/0898-1221(94)00194-4
fatcat:7ew3wflpsbbira2q2dlrbv4lja
3. A Bibliography on Parallel and Vector Numerical Algorithms
[chapter]
1990
Parallel Algorithms for Matrix Computations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Although this is a bibliography on numerical methods, we have included a number of other references on machine architecture, programming languages, and other topics of interest to scientific computing. ...
Comparison of methods and algorithms for tridiagonal systems and for vecton'zation of dzfusion computation, in Numrich [1462], pp. 29-56. [4] W . ABU-SUFAH A N D A . MALONY [1986]. ...
The behaviour of conjugafe gradient based algorithms on a multi-vector processor with a memory hiemrchy, Tech. ...
doi:10.1137/1.9781611971705.ch3
fatcat:pkjwqy26bfcjneyf76jqebybei
Massively Parallel Linearly-Implicit Extrapolation Algorithms as a Powerful Tool in Process Simulation
[chapter]
1998
Advances in Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study the parallelization of linearly-implicit extrapolation codes for the solution of large scale PDE systems and differential algebraic equations on distributed memory machines. ...
The parallel algorithms exhibit scalability up to 64 processors already for medium-sized test problems. ...
The advantage of averaging is that the vectors used to iterate are consistent on all processors. ...
doi:10.1016/s0927-5452(98)80066-x
fatcat:jmdjge4egncnflmgfdaolt2yse
ParFUM: a parallel framework for unstructured meshes for scalable dynamic physics applications
2006
Engineering with Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The Charm++ Parallel Framework for Unstructured Meshes allows one to write parallel programs that operate on unstructured meshes with only minimal knowledge of parallel computing, while making it possible ...
The framework is highly flexible and has been enhanced with numerous capabilities for the manipulation of unstructured meshes, such as parallel mesh adaptivity and collision detection. 1 ...
We would also like to thank our collaborators on the various applications that make use of Par-FUM: Philippe Geubelle, Michael Breitenfeld, Sandhya Mangala and Robert Haber. ...
doi:10.1007/s00366-006-0039-5
fatcat:qm2vq7rl3vh4vj7ayu2ggpowx4
ACTS – A COLLECTION OF HIGH PERFORMING SOFTWARE TOOLS FOR SCIENTIFIC COMPUTING
2003
Realizing Teracomputing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
They tackle a number of computational issues that are common to a large number of scientific applications, mainly implementation of numerical algorithms, and support for code development, execution and ...
Further, many new discoveries depend on high performance computer simulations to satisfy their demands for large computational resources and short response time. ...
Acknowledgements The ACTS Collection project is funded by the US Department of Energy, office of Mathematical, Information and Computation Science.
LADrummond-2002 submitted to ...
doi:10.1142/9789812704832_0016
fatcat:3sjml3yfr5cpjmke2gjbxzqthy
« Previous
Showing results 1 — 15 out of 2,336 results