Sciweavers

417 search results - page 29 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
MOC
2010
13 years 3 months ago
Entropy-satisfying relaxation method with large time-steps for Euler IBVPs
This paper could have been given the title: "How to positively and implicitly solve Euler equations using only linear scalar advections." The new relaxation method we pr...
Frédéric Coquel, Quang Long Nguyen, ...
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 8 months ago
Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
A class of trust-region methods is presented for solving unconstrained nonlinear and possibly nonconvex discretized optimization problems, like those arising in systems governed by...
Serge Gratton, Annick Sartenaer, Philippe L. Toint
ICPR
2004
IEEE
14 years 9 months ago
Linear and Non-linear Geometric Object Matching with Implicit Representation
This paper deals with the matching of geometric objects including points, curves, surfaces, and subvolumes using implicit object representations in both linear and non-linear sett...
Alex D. Leow, Henry S. C. Huang, Hillary Protas, L...
AMC
2005
87views more  AMC 2005»
13 years 8 months ago
Wavelet based preconditioners for sparse linear systems
A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equatio...
B. V. Rathish Kumar, Mani Mehra
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...