tr2000.bib

@COMMENT{{This file has been generated by bib2bib 1.46}}

@COMMENT{{Command line: /webadmin/algweb/bin/bib2bib -q -oc /WWW/algor/reports/tagstr2000 -ob /WWW/algor/reports/tr2000.bib -c 'number : ".*/.*pa.*/.*"' -c year=2000 /WWW/algor/reports/tr.bib}}

@COMMENT{{This file has been generated by bib2bib 1.46}}

@COMMENT{{Command line: /webadmin/algweb/bin/bib2bib -q -oc /WWW/algor/reports/tagstr -ob /WWW/algor/reports/trnourl.bib -c 'number : ".*/.*pa.*/.*"' /WWW/algor/reports/all.bib}}

@TECHREPORT{algoreport:99a,
  AUTHOR = {The Parallel Algorithms Project},
  TITLE = {Scientific {R}eport for 1999 (without images)},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  TYPE = {{T}echnical {R}eport},
  NUMBER = {TR/PA/00/0a},
  PS = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_0a.ps.gz},
  PDF = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_0a.pdf}
}

@TECHREPORT{algoreport:99b,
  AUTHOR = {The Parallel Algorithms Project},
  TITLE = {Scientific {R}eport for 1999 (with images)},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  TYPE = {{T}echnical {R}eport},
  NUMBER = {TR/PA/00/0b},
  PS = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_0b.ps.gz},
  PDF = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_0b.pdf}
}

@TECHREPORT{cadg:99a,
  AUTHOR = {B.~Carpentieri and I.~S.~Duff and L.~Giraud},
  TITLE = {Experiments with sparse preconditioning of dense
       problems from electromagnetic applications.},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/04},
  TYPE = {{T}echnical {R}eport},
  KEYWORDS = {Krylov subspaces methods, preconditioning techniques, 
               sparse approximate inverse, electromagnetic scattering, boundary element method.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_04.ps.gz}
}

@TECHREPORT{cadg:99b,
  AUTHOR = {B.~Carpentieri and I.~S.~Duff and L.~Giraud},
  TITLE = {Sparse pattern selection strategies for robust
       {F}robenius-norm minimization preconditioners in
       electromagnetism},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/05},
  TYPE = {{Technical Report}},
  NOTE = {Also {T}echnical {R}eport {RAL-TR-2000-009}. Preliminary version of the article published in
       {N}umerical {L}inear {A}lgebra with {A}pplications, vol. 7,
       nber 7-8, pp 667-685},
  KEYWORDS = {Preconditioning techniques, {F}robenius-norm minimization method, 
                nonzero pattern selection strategies, electromagnetic scattering applications.},
  PS = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_05.ps.gz},
  PDF = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_05.pdf}
}

@TECHREPORT{daag:99,
  AUTHOR = {S.~K.~Dallakyan and N.~S.~Ananikian and
       R.~G.~Ghulghazaryan},
  TITLE = {Thermodynamic chaos and infinitely many critical
       exponents in the Baxter-Wu model},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/06},
  TYPE = {{T}echnical {R}eport},
  NOTE = {Submitted for publication to Physica D,
       cond-mat/9909289},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_06.ps.gz}
}

@TECHREPORT{dall:99,
  AUTHOR = {S.~Dallakyan},
  TITLE = {A note on the visualization of multiparametric
       bifurcations},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/07},
  TYPE = {{T}echnical {R}eport},
  NOTE = {Preliminary version of the article published in Computers & Graphics,
       vol. 24, nber 2, pp 269-270, 2000},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_07.ps.gz}
}

@TECHREPORT{adel:00,
  AUTHOR = {P.~R.~Amestoy and I.~S.~Duff and J.-Y.~L'Excellent
       and X.~S.~Li},
  TITLE = {Analysis, Tuning and Comparison of Two General
       Sparse Solvers for Distributed Memory Computers},
  INSTITUTION = {CERFACS},
  YEAR = {2000},
  NUMBER = {TR/PA/00/72},
  TYPE = {{Technical Report}},
  NOTE = {Preliminary version of the article published in {\it {ACM} {T}rans. {M}ath. {S}oftw.}, vol. 27, pp 338-421},
  KEYWORDS = {Sparse linear systems, distributed memory codes, multifrontal, 
                supernodal, direct methods, comparison of codes.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_72.ps.gz}
}

@TECHREPORT{adel:00b,
  AUTHOR = {P.~R.~Amestoy and I.~S.~Duff and J.-Y.~L'Excellent
       and X.~S.~Li},
  TITLE = {Analysis and Comparison of Two General Sparse
       Solvers for Distributed Memory Computers},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  MONTH = {December},
  NUMBER = {TR/PA/00/90},
  NOTE = {Preliminary version of the article published in
            {\it ACM Trans. Math. Softw.}, (2001), {\bf 27}-4, pp. 1-33},
  KEYWORDS = {sparse linear systems, distributed memory codes, multifrontal, 
                supernodal, direct methods, comparison of codes.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_90.ps.gz}
}

@TECHREPORT{adel:00c,
  AUTHOR = {P.~R.~Amestoy and I.~S.~Duff and J.-Y.~L'Excellent
       and X.~S.~Li},
  TITLE = {Performance and tuning of two distributed memory
       sparse solvers},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  MONTH = {December},
  NUMBER = {TR/PA/00/91},
  NOTE = {Accepted for presentation at the Tenth SIAM
       Conference on Parallel Processing for Scientific
       Computing that will be held in Norfolk, Virginia
       from March 12th-14th, 2001},
  KEYWORDS = {sparse linear systems, distributed memory codes, multifrontal, 
                supernodal, direct methods, comparison of codes.},
  PS = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_91.ps.gz},
  PDF = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_91.pdf}
}

@TECHREPORT{bocf:00,
  AUTHOR = {A.~Bouras and F.~Chaitin-Chatelin and V.~Frayss{é}},
  TITLE = {{Solveurs itératifs imbriqués}},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {FR/PA/00/19},
  TYPE = {{C}ontract {R}eport},
  KEYWORDS = {inner-outer iterations, {K}rylov methods, linear systems, 
               eigenproblems, domain decomposition methods, inexact methods.}
}

@TECHREPORT{bofg:00,
  AUTHOR = {A.~Bouras and V.~Frayssé and L.~Giraud},
  TITLE = {A relaxation strategy for inner-outer linear solvers
       in domain decomposition methods},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/17},
  TYPE = {{Technical Report}},
  KEYWORDS = {domain decomposition linear systems, iterative methods, 
               inner-outer iterations.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_17.ps.gz}
}

@TECHREPORT{bofr:00a,
  AUTHOR = {A.~Bouras and V.~Frayssé},
  TITLE = {A relaxation strategy for inexact matrix-vector
       products for {K}rylov methods},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/15},
  TYPE = {{Technical Report}},
  NOTE = {{Submitted to SIAM Journal in Matrix Analysis and
       Applications}},
  KEYWORDS = {linear systems, iterative methods, {K}rylov methods, 
               inner-outer iterations.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_15.ps.gz}
}

@TECHREPORT{bofr:00b,
  AUTHOR = {A.~Bouras and V.~Frayssé},
  TITLE = {A relaxation strategy for the {A}rnoldi method in
       eigenproblems},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/16},
  TYPE = {{Technical Report}},
  KEYWORDS = {eigenvalue, iterative method, {K}rylov methods, inner-outer iterations.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_16.ps.gz}
}

@TECHREPORT{cha:00a,
  AUTHOR = {F.~{Chaitin-Chatelin}},
  TITLE = {Comprendre les méthodes de {K}rylov en précision
       finie~: le programme du {G}roupe {Q}ualitative
       {C}omputing au {CERFACS}},
  INSTITUTION = {CERFACS},
  YEAR = {2000},
  NUMBER = {TR/PA/00/11},
  TYPE = {{T}echnical {R}eport},
  KEYWORDS = {Algorithme d'{A}rnoldi de base, calcul inexact, perturbations
               homotopiques, solveurs emboités, arrêt heureux, erreur inverse,
               erreur de méthode.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_11.ps.gz}
}

@TECHREPORT{chdf:00,
  AUTHOR = {F.~Chaitin-Chatelin and S.~Dallakyan and
       V.~Frayssé},
  TITLE = {{GPS} {C}arrier {P}hase {A}mbiguity {R}esolution
       with the {LAMBDA} method:~1. A stability analysis
       2. An exponential speed-up},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {CR/PA/00/52},
  TYPE = {Contract Report},
  KEYWORDS = {{GPS}, integer ambiguities, {LAMBDA} method.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/CR_PA_00_52.ps.gz}
}

@TECHREPORT{chmz:00a,
  AUTHOR = {F.~Chaitin-Chatelin and T.~Me\v skauskas and
       A.~N.~Zaoui},
  TITLE = {Computation with Hypercomplex Numbers},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/69},
  TYPE = {{Technical Report}},
  NOTE = {Preliminary version of the article published in the Proceedings of 3rd World Congress
       	    of $Nonlinear Analysis$, vol. 47, pp. 3391-3400, 2001},
  KEYWORDS = {hypercomplex numbers, quaternions, octonions, division algebra,
                {N}ature's computation, logistic iteration, {M}andelbrot set.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_69.ps.gz}
}

@TECHREPORT{chmz:00b,
  AUTHOR = {F.~Chaitin-Chatelin and T.~Me\v skauskas and
       A.~N.~Zaoui},
  TITLE = {About real and binary algebras: the interplay
       between geometry and algebra},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/74},
  TYPE = {{Technical Report}},
  KEYWORDS = {hypercomplex numbers, hypercomplex algebras, quaternions, 
                octonions, division algebra, composition algebra, geometry, 
                four-color theorem.},
  PS = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_74.ps.gz},
  PDF = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_74.pdf}
}

@TECHREPORT{chtp:00,
  AUTHOR = {F.~{Chaitin-Chatelin} and E.~Traviesas and
       L.~Planti{é}},
  TITLE = {Understanding {K}rylov methods in finite precision},
  YEAR = {2000},
  NOTE = {Preliminary version of the article published in {L}. {V}ulkov et al. (eds), Proceedings of NAA 2000,  
               pp 187-197, {S}pringer {V}erlag {LNCS}, vol. 1988, 2000},
  PUBLISHER = {Springer Verlag},
  NUMBER = {TR/PA/00/40},
  KEYWORDS = {Eigenvalues, {K}rylov subspace, {A}rnoldi method, {H}appy {B}reackdown, 
               finite precision, backward error, homotopic perturbations.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_40.ps.gz}
}

@TECHREPORT{chtr:00,
  AUTHOR = {F.~{Chaitin-Chatelin} and E.~Traviesas},
  TITLE = {{PRECISE}, a toolbox for assessing the quality of
       numerical methods and software},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/12},
  TYPE = {{T}echnical {R}eport},
  NOTE = {Proceedings of the 16th IMACS World
       Congress, Lausanne, Switzerland},
  KEYWORDS = {Recommender systems, backward-error analysis, condition,
               reliability, sensitivity analysis.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_12.ps.gz}
}

@TECHREPORT{duvo:00,
  AUTHOR = {I.~S.~Duff and C.~Vömel},
  TITLE = {{Level 2 and Level 3 Basic Linear Algebra
       Subprograms for Sparse Matrices: A Fortran 95
       instantiation}},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/18},
  TYPE = {{Technical Report}},
  KEYWORDS = {unstructured sparse matrices, sparse data structures,
               programming standard, iterative linear solvers, {BLAS},
               {S}parse{BLAS}.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_18.ps.gz}
}

@TECHREPORT{duvo:00a,
  AUTHOR = {I.~S.~Duff and C.~Vömel},
  TITLE = {Incremental {N}orm {E}stimation for {D}ense and
       {S}parse {M}atrices},
  INSTITUTION = {CERFACS},
  YEAR = {2000},
  ADDRESS = {Toulouse, France},
  NUMBER = {TR/PA/00/83},
  KEYWORDS = {matrix norm, condition number, incremental estimators, 
               approximate singular vectors, sparse triangular matrices, 
               {QR} factorization, rank-revealing.},
  NOTE = {Preliminary version of the article published in BIT, Numerical Mathematics, Volume 42, Issue 2 (June 2002), pp. 300--322},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_83.ps.gz}
}

@TECHREPORT{duvoyo:00,
  AUTHOR = {I.~S.~Duff and C.~Vömel and M.~Youan},
  TITLE = {Implementing the {S}parse {BLAS} in {F}ortran 95},
  INSTITUTION = {CERFACS},
  YEAR = {2000},
  ADDRESS = {Toulouse, France},
  NUMBER = {TR/PA/00/82},
  KEYWORDS = {unstructured sparse matrices, sparse data structures, 
                programming standard, iterative linear solvers, 
                {BLAS}, {S}parse {BLAS}.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_82.ps.gz}
}

@TECHREPORT{frgi:00,
  AUTHOR = {V.~Frayssé and L.~Giraud},
  TITLE = {A Set of Conjugate Gradient Routines for Real and
       Complex Arithmetics},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/47},
  TYPE = {{T}echnical {R}eport},
  KEYWORDS = {linear systems, {K}rylov methods, {CG}, reverse communication, 
                distributed memory.},
  PS = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_47.ps.gz},
  PDF = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_47.pdf}
}

@TECHREPORT{gost:00,
  AUTHOR = {N.~I.~M.~Gould and D.~Orban and A.~Sartenaer and
       Ph.~L.~Toint},
  TITLE = {Superlinear convergence of primal-dual interior
       point algorithms for nonlinear programming},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/20},
  TYPE = {{Technical Report}},
  NOTE = {Preliminary version of the article published in
       {\it SIAM J. Optimization}, (2001), {\bf 11}-4, pp 974-1002},
  KEYWORDS = {primal-dual interior point method, componentwise {Q}-superlinear convergence.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_20.ps.gz}
}

@TECHREPORT{gost:00b,
  AUTHOR = {N.~I.~M.~Gould and D.~Orban and A.~Sartenaer and
       Ph.~L.~Toint},
  TITLE = {Componentwise fast convergence in the solution of
       full-rank systems of nonlinear equations},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/56},
  TYPE = {{Technical Report}},
  NOTE = {Preliminary version of the article published in {\em Mathematical Programming Serie B}, vol. 92. nber 3, pp. 481-508, 2002},
  KEYWORDS = {nonlinear systems of equations, path-following methods, componentwise {Q}-superlinear convergence.},
  PS = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_56.ps.gz},
  PDF = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_56.pdf}
}

@TECHREPORT{gost:00c,
  AUTHOR = {N.~I.~M.~Gould and D.~Orban and A.~Sartenaer and
       Ph.~L.~Toint},
  TITLE = {{High Rates of Convergence of Primal-Dual Interior
       Point Algorithms for Nonlinear Programming}},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/63},
  TYPE = {{Technical Report}},
  KEYWORDS = {primal-dual interior-point method, componentwise convergence.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_63.ps.gz}
}

@TECHREPORT{guev:00,
  AUTHOR = {F.~Guevara Vasquez},
  TITLE = {Internship report on Domain Decomposition Methods
       for the solution of Partial Differential Equations},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/98},
  TYPE = {{T}echnical {R}eport}
}

@TECHREPORT{lebl:00,
  AUTHOR = {S.~Leblond},
  TITLE = {Two direct methods for large sparse problems:
       Multifrontal Massively Parallel Solver {(MUMPS)} and
       Fast Parallel Direct Solver for Coarse Grid Problems
       ({H. TUFO})},
  INSTITUTION = {CERFACS},
  YEAR = {2000},
  NUMBER = {WN/PA/00/105},
  TYPE = {{T}echnical {R}eport}
}

@TECHREPORT{mecb:00,
  AUTHOR = {T.~Me\v skauskas and P.~Caminal and A.~Bayes de
       Luna},
  TITLE = {Calculation of 1/ f noise indexes from
       electrocardiogram data in detection of cardiac
       illness},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/81},
  KEYWORDS = {Electrocardiogram ({ECG}), {ECG} processing, 1/ f noise, 
               spectral analysis, chaos theory.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_81.ps.gz}
}

@TECHREPORT{meiv:00,
  AUTHOR = {T.~Me\v skauskas and F.~Ivanauskas},
  TITLE = {Initial Boundary-Value Problems for Derivative
       Nonlinear Schrödinger Equation. Justification of
       Two-Step Algorithm},
  INSTITUTION = {CERFACS},
  YEAR = {2000},
  NUMBER = {TR/PA/00/70},
  TYPE = {{Technical Report}},
  KEYWORDS = {Derivative nonlinear {S}chrodinger equation, initial boundary-value problem, 
                {B}acklund transformations, {C}rank-{N}icolson finite difference scheme, 
                convergence and stability of difference schemes.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_70.ps.gz}
}

@TECHREPORT{plan:00,
  AUTHOR = {L.~Plantié},
  TITLE = {The boundary layer problem of triple deck type},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/61},
  TYPE = {{Technical Report}},
  NOTE = {Also in Proceedings of the Second Conference on
       Numerical Analysis and Applications, Rousse,
       Bulgaria, Springer Verlag, pp 675--683},
  KEYWORDS = {Boundary layer, triple deck, semi-discretization, existence, asymptotic behaviour.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_61.ps.gz}
}

@TECHREPORT{plan:00a,
  AUTHOR = {L.~Planti{é}},
  TITLE = {A semi-discrete problem for the boundary layer of
       triple deck type (Part 1)},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/45},
  TYPE = {{Technical Report}},
  KEYWORDS = {Boundary layer, triple deck, semi-discretization, existence, 
                asymptotic behaviour, uniqueness.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_45.ps.gz}
}

@TECHREPORT{plan:00b,
  AUTHOR = {L.~Planti{é}},
  TITLE = {A semi-discrete problem for the boundary layer of
       triple deck type (Part 2)},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/46},
  TYPE = {{Technical Report}},
  KEYWORDS = {Boundary layer, triple deck, semi-discretization, existence, 
                asymptotic behaviour, uniqueness.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_46.ps.gz}
}

@TECHREPORT{roso:00,
  AUTHOR = {M.~Rojas and D.~C.~Sorensen},
  TITLE = {A Trust-Region Approach to the Regularization of
       Large-Scale Discrete Ill-Posed Problems},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/57},
  TYPE = {{Technical Report}},
  NOTE = {Preliminary version of the article published in SIAM {J}ournal on {S}cientific {C}omputing, vol. 26, nber 3, pp 1843-1861, 2002},
  KEYWORDS = {regularization, constrained quadratic optimization,
                trust region, {L}anczos method, ill-posed problems, inverse
                problems, seismic inversion.},
  PS = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_57.ps.gz},
  PDF = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_57.pdf}
}

@TECHREPORT{trza:00,
  AUTHOR = {A.~N.~Zaoui and E.~Traviesas},
  TITLE = {The hybrid eigensolver {I}{S}{A} to compute the $r$
       eigenvalues closest to a given complex point : A
       qualitative study},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/13},
  NOTE = {16th IMACS World Congress, Lausanne, Switzerland},
  KEYWORDS = {Hybrid eigensolver, block {A}rnoldi method, {S}ubspace {I}terations method, spectral transformation, numerical quality.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_13.ps.gz}
}

@TECHREPORT{trza:00a,
  AUTHOR = {A.~N.~Zaoui and E.~Traviesas},
  TITLE = {Sur la fiabilité et la robustesse du code ISABeL},
  INSTITUTION = {CERFACS, Toulouse, France},
  YEAR = {2000},
  NUMBER = {TR/PA/00/76},
  TYPE = {{Technical Report}},
  KEYWORDS = {Méthode d'{A}rnoldi-{B}loc, méthode des {I}térations {S}imultanées, 
                valeurs propres, critères de convergence, arithmétique exacte, précision finie.},
  URL = {http://www.cerfacs.fr/algor/reports/2000/TR_PA_00_76.ps.gz}
}