You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@commons.apache.org by "greg sterijevski (JIRA)" <ji...@apache.org> on 2011/07/20 19:20:58 UTC
[jira] [Created] (MATH-624) Need a method to solve upper and lower
triangular systems
Need a method to solve upper and lower triangular systems
---------------------------------------------------------
Key: MATH-624
URL: https://issues.apache.org/jira/browse/MATH-624
Project: Commons Math
Issue Type: New Feature
Affects Versions: 3.0
Environment: Java
Reporter: greg sterijevski
Fix For: 3.0
I have run into a need to solve triangular systems. While (as Phil and Ted point out) I could use the LU and QR decompositions, it seems cleaner to have a couple of static functions which do this. I am including a patch to provide an implementation and the tests.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
[jira] [Resolved] (MATH-624) Need a method to solve upper and lower
triangular systems
Posted by "Phil Steitz (JIRA)" <ji...@apache.org>.
[ https://issues.apache.org/jira/browse/MATH-624?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Phil Steitz resolved MATH-624.
------------------------------
Resolution: Fixed
Patch applied in r1156968 with one change:
s/MathRuntimeException.CreateXxx/new Xxx throughout. The former usage is deprecated.
Thanks for the patch!
> Need a method to solve upper and lower triangular systems
> ---------------------------------------------------------
>
> Key: MATH-624
> URL: https://issues.apache.org/jira/browse/MATH-624
> Project: Commons Math
> Issue Type: New Feature
> Affects Versions: 3.0
> Environment: Java
> Reporter: greg sterijevski
> Assignee: Phil Steitz
> Labels: Backsolve, Forwardsolve, LowerTriangular, UpperTriangular
> Fix For: 3.0
>
> Attachments: upperlowermethods, upperlowertests
>
> Original Estimate: 0h
> Remaining Estimate: 0h
>
> I have run into a need to solve triangular systems. While (as Phil and Ted point out) I could use the LU and QR decompositions, it seems cleaner to have a couple of static functions which do this. I am including a patch to provide an implementation and the tests.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
[jira] [Updated] (MATH-624) Need a method to solve upper and lower
triangular systems
Posted by "greg sterijevski (JIRA)" <ji...@apache.org>.
[ https://issues.apache.org/jira/browse/MATH-624?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
greg sterijevski updated MATH-624:
----------------------------------
Attachment: upperlowertests
upperlowermethods
Both patches pass the checkstyle check and the findbugs...
> Need a method to solve upper and lower triangular systems
> ---------------------------------------------------------
>
> Key: MATH-624
> URL: https://issues.apache.org/jira/browse/MATH-624
> Project: Commons Math
> Issue Type: New Feature
> Affects Versions: 3.0
> Environment: Java
> Reporter: greg sterijevski
> Labels: Backsolve, Forwardsolve, LowerTriangular, UpperTriangular
> Fix For: 3.0
>
> Attachments: upperlowermethods, upperlowertests
>
> Original Estimate: 0h
> Remaining Estimate: 0h
>
> I have run into a need to solve triangular systems. While (as Phil and Ted point out) I could use the LU and QR decompositions, it seems cleaner to have a couple of static functions which do this. I am including a patch to provide an implementation and the tests.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira