{"action":"created","issue":{"url":"https://api.github.com/repos/mathnet/mathnet-numerics/issues/432","repository_url":"https://api.github.com/repos/mathnet/mathnet-numerics","labels_url":"https://api.github.com/repos/mathnet/mathnet-numerics/issues/432/labels{/name}","comments_url":"https://api.github.com/repos/mathnet/mathnet-numerics/issues/432/comments","events_url":"https://api.github.com/repos/mathnet/mathnet-numerics/issues/432/events","html_url":"https://github.com/mathnet/mathnet-numerics/issues/432","id":178106235,"number":432,"title":"Matrix<double> Inverse fails","user":{"login":"Goicox","id":7782628,"avatar_url":"https://avatars.githubusercontent.com/u/7782628?v=3","gravatar_id":"","url":"https://api.github.com/users/Goicox","html_url":"https://github.com/Goicox","followers_url":"https://api.github.com/users/Goicox/followers","following_url":"https://api.github.com/users/Goicox/following{/other_user}","gists_url":"https://api.github.com/users/Goicox/gists{/gist_id}","starred_url":"https://api.github.com/users/Goicox/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Goicox/subscriptions","organizations_url":"https://api.github.com/users/Goicox/orgs","repos_url":"https://api.github.com/users/Goicox/repos","events_url":"https://api.github.com/users/Goicox/events{/privacy}","received_events_url":"https://api.github.com/users/Goicox/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":{"login":"cdrnet","id":47147,"avatar_url":"https://avatars.githubusercontent.com/u/47147?v=3","gravatar_id":"","url":"https://api.github.com/users/cdrnet","html_url":"https://github.com/cdrnet","followers_url":"https://api.github.com/users/cdrnet/followers","following_url":"https://api.github.com/users/cdrnet/following{/other_user}","gists_url":"https://api.github.com/users/cdrnet/gists{/gist_id}","starred_url":"https://api.github.com/users/cdrnet/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/cdrnet/subscriptions","organizations_url":"https://api.github.com/users/cdrnet/orgs","repos_url":"https://api.github.com/users/cdrnet/repos","events_url":"https://api.github.com/users/cdrnet/events{/privacy}","received_events_url":"https://api.github.com/users/cdrnet/received_events","type":"User","site_admin":false},"assignees":[{"login":"cdrnet","id":47147,"avatar_url":"https://avatars.githubusercontent.com/u/47147?v=3","gravatar_id":"","url":"https://api.github.com/users/cdrnet","html_url":"https://github.com/cdrnet","followers_url":"https://api.github.com/users/cdrnet/followers","following_url":"https://api.github.com/users/cdrnet/following{/other_user}","gists_url":"https://api.github.com/users/cdrnet/gists{/gist_id}","starred_url":"https://api.github.com/users/cdrnet/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/cdrnet/subscriptions","organizations_url":"https://api.github.com/users/cdrnet/orgs","repos_url":"https://api.github.com/users/cdrnet/repos","events_url":"https://api.github.com/users/cdrnet/events{/privacy}","received_events_url":"https://api.github.com/users/cdrnet/received_events","type":"User","site_admin":false}],"milestone":null,"comments":3,"created_at":"2016-09-20T16:14:03Z","updated_at":"2017-02-14T16:23:22Z","closed_at":"2016-10-24T20:10:18Z","body":"I am new using MathNet.Numerics. I would like to calculate the pseudo-inverse of A*A'. The resulting product is a square matrix. \n\nIn the following example .Inverse fails because the matrix is close to singular or badly scaled.\n\n(A \\* A.Transpose()).Inverse()\n\nB = A \\* A'\nB = ...\n[0.25295692838587958 0.61194073916551683\n0.61194073916551683 1.4803764049474544]\n\nIs it possible to compute the pseudo-inverse of this type of matrices? \nKindly advise. Goicox\n"},"comment":{"url":"https://api.github.com/repos/mathnet/mathnet-numerics/issues/comments/279756477","html_url":"https://github.com/mathnet/mathnet-numerics/issues/432#issuecomment-279756477","issue_url":"https://api.github.com/repos/mathnet/mathnet-numerics/issues/432","id":279756477,"user":{"login":"premsh","id":2452916,"avatar_url":"https://avatars.githubusercontent.com/u/2452916?v=3","gravatar_id":"","url":"https://api.github.com/users/premsh","html_url":"https://github.com/premsh","followers_url":"https://api.github.com/users/premsh/followers","following_url":"https://api.github.com/users/premsh/following{/other_user}","gists_url":"https://api.github.com/users/premsh/gists{/gist_id}","starred_url":"https://api.github.com/users/premsh/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/premsh/subscriptions","organizations_url":"https://api.github.com/users/premsh/orgs","repos_url":"https://api.github.com/users/premsh/repos","events_url":"https://api.github.com/users/premsh/events{/privacy}","received_events_url":"https://api.github.com/users/premsh/received_events","type":"User","site_admin":false},"created_at":"2017-02-14T16:23:22Z","updated_at":"2017-02-14T16:23:22Z","body":"Okay, I am pretty sure this is not the best place to ask a question but I will do it anyway in the hope of some form of answer. \r\n\r\nIs there a way to solve the inverse of the positive matrix so that the inverse matrix is non-negative? Or what's out there to ensure that we can try again and again to end up with non-negative matrix in the most efficient manner?  "}}
{"actor":{"display_login":"premsh"}}