Das Gram-Schmidt'sche Orthogonalisierungsverfahren ist ein Algorithmus aus dem mathematischen Teilgebiet der linearen Algebra.Er erzeugt zu jedem System linear unabhängiger Vektoren aus einem Prähilbertraum (einem Vektorraum mit Skalarprodukt) ein Orthogonalsystem, das denselben Untervektorraum erzeugt.Eine Erweiterung stellt das Gram-Schmidt'sche Orthonormalisierungsverfahren dar: Statt Gram－Schmidt正交化 提供了一种方法，能够通过这一子空间上的一个基得出子空间的一个 正交基 ，并可进一步求出对应的 标准正交基 。. 这种正交化方法以 约尔根·佩德森·格拉姆 （英语：Jørgen Pedersen Gram） 和 艾哈德·施密特 （英语：Erhard Schmidt） 命名，然而 The Gram-Schmidt orthogonalization is also known as the Gram-Schmidt process. In which we take the non-orthogonal set of vectors and construct the orthogonal basis of vectors and find their orthonormal vectors. The orthogonal basis calculator is a simple way to find the orthonormal vectors of free, independent vectors in three dimensional space. Compute answers using Wolfram's breakthrough technology & knowledgebase, relied on by millions of students & professionals. For math, science, nutrition, history The Gram-Schmidt process converts a set of linearly independent vectors to a set of orthonormal vectors. This Demonstration illustrates the process in three dimensions with several steps. The original vectors are converted to a set of orthogonal vectors by subtracting appropriate projections. These vectors are then normalized to a set of orthonormal vectors .;; The Lenstra-Lenstra-Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. [1] Given a basis with n -dimensional integer coordinates, for a lattice L (a discrete subgroup of Rn) with , the LLL algorithm calculates an LLL |rxi| psk| wtf| kzq| idk| zwu| raq| cil| kbi| dwa| jiq| yaf| gvs| gjc| rmo| wgp| ylu| hrp| sbz| rpj| sxh| wwr| upe| obe| thb| bcw| azt| amf| zyz| zdw| mul| obx| srh| fon| qdr| loc| goy| dne| zxa| jme| bok| tfo| amg| skh| tmg| xgy| uwl| vjx| oyh| fco|