منابع مشابه
Null-Space Preconditioners for Saddle Point Systems
We will present theory that underpins the use of null-space preconditioners, giving eigenvalue bounds that show that the eigenvalues of the preconditioned system are clustered when a good approximation to the null-space matrix can be found. Additionally, we will describe how two of the family of preconditioners, although indefinite and non-symmetric, can be applied with a Krylov method with a s...
متن کاملA New Method of Mobile Robot Navigation: Shortest Null Space
In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...
متن کاملComputation in Projective Space
This paper presents solutions of some selected problems that can be easily solved by the projective space representation. If the principle of duality is used, quite surprising solutions can be found and new useful theorems can be generated as well. There are many algorithms based on computation of intersection of lines, planes, barycentric coordinates etc. Those algorithms are based on represen...
متن کاملPseudo Ricci symmetric real hypersurfaces of a complex projective space
Pseudo Ricci symmetric real hypersurfaces of a complex projective space are classified and it is proved that there are no pseudo Ricci symmetric real hypersurfaces of the complex projective space CPn for which the vector field ξ from the almost contact metric structure (φ, ξ, η, g) is a principal curvature vector field.
متن کاملA New Method of Mobile Robot Navigation: Shortest Null Space
In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1945
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1945-08456-0