Sciweavers

573 search results - page 57 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
JVCA
2008
89views more  JVCA 2008»
13 years 9 months ago
A physically faithful multigrid method for fast cloth simulation
We present an efficient multigrid algorithm that is adequate to solve a heavy linear system given in cloth simulation. Although multigrid has been successfully applied to the Pois...
Seungwoo Oh, Jun-yong Noh, KwangYun Wohn
SIAMJO
2008
92views more  SIAMJO 2008»
13 years 9 months ago
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
Alexey F. Izmailov, Mikhail V. Solodov
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
14 years 23 days ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
AUTOMATICA
2011
13 years 4 months ago
Sequential linear quadratic control of bilinear parabolic PDEs based on POD model reduction
We present a framework to solve a finite-time optimal control problem for parabolic partial differential equations (PDEs) with diffusivity-interior actuators, which is motivate...
Chao Xu, Yongsheng Ou, Eugenio Schuster