Sciweavers

6045 search results - page 103 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
MOC
2002
98views more  MOC 2002»
13 years 7 months ago
Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Abstract. A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The s...
Mari Paz Calvo, Cesar Palencia
JPDC
2007
97views more  JPDC 2007»
13 years 7 months ago
MPI implementation of parallel subdomain methods for linear and nonlinear convection-diffusion problems
The solution of linear and nonlinear convection–diffusion problems via parallel subdomain methods is considered. MPI implementation of parallel Schwarz alternating methods on di...
Chau Ming, Didier El Baz, Ronan Guivarch, Pierre S...
ORL
2007
61views more  ORL 2007»
13 years 7 months ago
Exact solutions to linear programming problems
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutio...
David Applegate, William J. Cook, Sanjeeb Dash, Da...
MICS
2010
62views more  MICS 2010»
13 years 2 months ago
Linear Differential Elimination for Analytic Functions
This paper provides methods to decide whether a given analytic function of several complex variables is a linear combination of finitely many given analytic functions with coeffic...
Wilhelm Plesken, Daniel Robertz
CVPR
2009
IEEE
15 years 3 months ago
Rank Priors for Continuous Non-Linear Dimensionality Reduction
Non-linear dimensionality reductionmethods are powerful techniques to deal with high-dimensional datasets. However, they often are susceptible to local minima and perform poorly ...
Andreas Geiger (Karlsruhe Institute of Technology)...