About: Constrained generalized inverse     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Matrix108267640, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FConstrained_generalized_inverse&graph=http%3A%2F%2Fdbpedia.org&graph=http%3A%2F%2Fdbpedia.org

In linear algebra, a constrained generalized inverse is obtained by solving a system of linear equations with an additional constraint that the solution is in a given subspace. One also says that the problem is described by a system of constrained linear equations. In many practical problems, the solution of a linear system of equations is acceptable only when it is in a certain linear subspace of . In the following, the orthogonal projection on will be denoted by .Constrained system of linear equations has a solution if and only if the unconstrained system of equations * v * t * e

AttributesValues
rdf:type
rdfs:label
  • Constrained generalized inverse (en)
rdfs:comment
  • In linear algebra, a constrained generalized inverse is obtained by solving a system of linear equations with an additional constraint that the solution is in a given subspace. One also says that the problem is described by a system of constrained linear equations. In many practical problems, the solution of a linear system of equations is acceptable only when it is in a certain linear subspace of . In the following, the orthogonal projection on will be denoted by .Constrained system of linear equations has a solution if and only if the unconstrained system of equations * v * t * e (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • In linear algebra, a constrained generalized inverse is obtained by solving a system of linear equations with an additional constraint that the solution is in a given subspace. One also says that the problem is described by a system of constrained linear equations. In many practical problems, the solution of a linear system of equations is acceptable only when it is in a certain linear subspace of . In the following, the orthogonal projection on will be denoted by .Constrained system of linear equations has a solution if and only if the unconstrained system of equations is solvable. If the subspace is a proper subspace of , then the matrix of the unconstrained problem may be singular even if the system matrix of the constrained problem is invertible (in that case, ). This means that one needs to use a generalized inverse for the solution of the constrained problem. So, a generalized inverse of is also called a -constrained pseudoinverse of . An example of a pseudoinverse that can be used for the solution of a constrained problem is the Bott–Duffin inverse of constrained to , which is defined by the equation if the inverse on the right-hand-side exists. * v * t * e (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 40 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software