Krylov subspace methods for solving large unsymmetric linear systems /

"COO-2383-0077"--P. 1 of cover.

Über die Picard'schen gruppen aus dem zahlkörper der dritten und der vierten einheitswurzel ...

Available on demand as hard copy or computer file from Cornell University Library.

Émile Picard; biographie, bibliographie analytique des écrits.

Available on demand as hard copy or computer file from Cornell University Library.

Un picard: Antoine Erlault, confesseur de Catherine de Médicis, évêque de Chalon-sur-Saone.

One of an edition of 100 copies.

Théâtre de Picard /

Introd.--La petite ville.--Duhautcours ou le contrat d'union.--Un jeu de la fortune ou les marionnettes.--Les deux Philibert.

Œuvres choisies de L. B. Picard.

La manie de briller, comédie.--Vanglas, ou Les anciens amis, comédie.--Une matinée de Henri IV, comédie.-- Le susceptible.

Ésprit du siècle en matière de religion par un Franc Picard.

Mode of access: Internet.

Ivan Andreevich Krylov kak dramaturg /

Őtdi͡e︡lʹnyĭ ottisk iz E̋zhegodnika imperatorskikh teatrov s̋ezona 1893-1894 gg.

Uber die picard'schen gruppen aus dem zahlkorper der dritten un...

Thesis (doctoral)--

Time complexity and convergence analysis of domain theoretic Picard method

We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.

Nadel's Subschemes of Fano Manifolds X with a Picard Group Pic(X) Isomorphic to Z

∗The author supported by Contract NSFR MM 402/1994.

Expokit: A software package for computing matrix exponentials

Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear ODEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.