This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obt...This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.展开更多
This paper presents the limiting expression for the gen calized inverse A T.S(2) and itscorresgonding projectors Since comonon imnortors inverses,such as and AT.S(2) etc are all generalized in e e AT.S(2) In fact,we g...This paper presents the limiting expression for the gen calized inverse A T.S(2) and itscorresgonding projectors Since comonon imnortors inverses,such as and AT.S(2) etc are all generalized in e e AT.S(2) In fact,we give a unified limiting formula of computine such imporiant generalined inverses and its corresponding proiectors,Based on this we estalish and imbedling method fire compoting the generalized in verse AT.S(2) The results extend earlier work by various authors.展开更多
The author introduces a notion of weakIsequences and characterizes such sequences by means of homological methods.This notion extends the notion of weakMsequences and thus extends the notions of generalized Cohen Maca...The author introduces a notion of weakIsequences and characterizes such sequences by means of homological methods.This notion extends the notion of weakMsequences and thus extends the notions of generalized Cohen Macaulay modules and Buchsbaum modules to more general cases.展开更多
基金This project is supported by the National Natural Science Foundation of China
文摘This paper presents a new highly parallel algorithm for computing the minimum-norm least-squares solution of inconsistent linear equations Ax = b(A∈Rm×n,b∈R (A)). By this algorithm the solution x = A + b is obtained in T = n(log2m + log2(n - r + 1) + 5) + log2m + 1 steps with P=mn processors when m × 2(n - 1) and with P = 2n(n - 1) processors otherwise.
基金This project is supported by the National Natural Science Foundation of China.
文摘This paper presents the limiting expression for the gen calized inverse A T.S(2) and itscorresgonding projectors Since comonon imnortors inverses,such as and AT.S(2) etc are all generalized in e e AT.S(2) In fact,we give a unified limiting formula of computine such imporiant generalined inverses and its corresponding proiectors,Based on this we estalish and imbedling method fire compoting the generalized in verse AT.S(2) The results extend earlier work by various authors.
文摘The author introduces a notion of weakIsequences and characterizes such sequences by means of homological methods.This notion extends the notion of weakMsequences and thus extends the notions of generalized Cohen Macaulay modules and Buchsbaum modules to more general cases.
