document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=196933>Question 196933</A>: <I><SPAN STYLE=\"word-break: break-all;\"> What is the complexity to evaluate the Moore-Penrose pseudoinverse of an n x m matrix? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #148020 by </B><A HREF=/tutors/aboutme.mpl?userid=solver91311><B>solver91311(24713)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=solver91311><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=solver91311><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=148020\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> <font face=\"Garamond\" size=\"+2\">\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Huge.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Go see:  http://en.wikipedia.org/wiki/Moore-Penrose_pseudoinverse\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "or: http://robotics.caltech.edu/~jwb/courses/ME115/handouts/pseudo.pdf\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "John<BR>\n" );
document.write( "<IMG STYLE=\"max-width:80%;\" SRC=\"/cgi-bin/rendertex.cgi?\LARGE e^{i\pi} + 1 = 0\"><BR>\n" );
document.write( "</font> </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );