From the collection of the Computer History Museum (www.computerhistory.org) An improved generalized inverse algorithm for linear inequalities and its applications

From the collection of the Computer History Museum (www.computerhistory.org) OPTIMIZA TION OF A RADAR IN ITS ENVIRONMENT BY GEESE* TECHNIQUES

GGMRES: A GMRES--type algorithm for solving singular linear equations with index one

In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...

An LPV Approach to Sensor Fault Diagnosis of Robotic Arm

One of the major challenges in robotic arms is to diagnosis sensor fault. To address this challenge, this paper presents an LPV approach. Initially, the dynamics of a two-link manipulator is modelled with a polytopic linear parameter varying structure and then by using a descriptor system approach and a robust design of a suitable unknown input observer by means of pole placement method along w...

An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.