Sciweavers

782 search results - page 14 / 157
» Numerical Recipes in C
Sort
View
FOCM
2007
94views more  FOCM 2007»
14 years 11 months ago
Trust-Region Methods on Riemannian Manifolds
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
Pierre-Antoine Absil, C. G. Baker, Kyle A. Galliva...
DCG
2010
67views more  DCG 2010»
14 years 12 months ago
Conformal Mapping in Linear Time
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
Christopher J. Bishop
TOMS
2008
96views more  TOMS 2008»
14 years 11 months ago
Block variants of Hammarling's method for solving Lyapunov equations
This paper is concerned with the efficient numerical solution of the Lyapunov equation AT X +XA = -C with a stable matrix A and a symmetric positive semidefinite matrix C of possi...
Daniel Kressner
AAECC
2004
Springer
83views Algorithms» more  AAECC 2004»
14 years 11 months ago
Bounding the Trellis State Complexity of Algebraic Geometric Codes
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
Carlos Munuera, Fernando Torres
MCS
2007
Springer
14 years 11 months ago
Computing the principal eigenvalue of the Laplace operator by a stochastic method
We describe a Monte Carlo method for the numerical computation of the principal eigenvalue of the Laplace operator in a bounded domain with Dirichlet conditions. It is based on th...
Antoine Lejay, Sylvain Maire