orthogonalization method

  • 11Zernike polynomials — Plots of the values in the unit disk.In mathematics, the Zernike polynomials are a sequence of polynomials that are orthogonal on the unit disk. Named after Frits Zernike, they play an important role in geometrical optics. DefinitionsThere are… …

    Wikipedia

  • 12Polynômes de Zernike — Tracés des polynômes de Zernike sur le disque unité. Les polynômes de Zernike sont une série de polynômes qui sont orthogonaux sur le disque unité. Ils portent le nom de Frits Zernike ; ils jouent un rôle important en optique géométrique.… …

    Wikipédia en Français

  • 13List of mathematics articles (O) — NOTOC O O minimal theory O Nan group O(n) Obelus Oberwolfach Prize Object of the mind Object theory Oblate spheroid Oblate spheroidal coordinates Oblique projection Oblique reflection Observability Observability Gramian Observable subgroup… …

    Wikipedia

  • 14Orthonormality — In linear algebra, two vectors in an inner product space are orthonormal if they are orthogonal and both of unit length. A set of vectors form an orthonormal set if all vectors in the set are mutually orthogonal and all of unit length. An… …

    Wikipedia

  • 15Sparse matrix — A sparse matrix obtained when solving a finite element problem in two dimensions. The non zero elements are shown in black. In the subfield of numerical analysis, a sparse matrix is a matrix populated primarily with zeros (Stoer Bulirsch 2002,… …

    Wikipedia

  • 16Iwasawa decomposition — In mathematics, the Iwasawa decomposition KAN of a semisimple Lie group generalises the way a square real matrix can be written as a product of an orthogonal matrix and an upper triangular matrix (a consequence of Gram Schmidt orthogonalization) …

    Wikipedia

  • 17Krylov subspace — In linear algebra the Krylov subspace generated by an n by n matrix, A , and an n vector, b , is the subspace mathcal{K} n spanned by the vectors of the Krylov sequence:::mathcal{K} n = operatorname{span} , { b, Ab, A^2b, ldots, A^{n 1}b }. , It… …

    Wikipedia

  • 18Lattice problem — In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to construction of secure lattice based cryptosystems. For applications in such cryptosystems,… …

    Wikipedia