Timeline for Is there a fast way to check if a matrix has any small eigenvalues?
Current License: CC BY-SA 4.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 27 at 17:47 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 43 characters in body
|
Jan 27 at 16:17 | history | edited | Will Jagy | CC BY-SA 4.0 |
deleted 39 characters in body
|
Jan 26 at 20:53 | comment | added | Will Jagy | @GordonRoyle yes, both qfsign() and qfgaussred() use exact arithmetic, integer and rational numbers | |
Jan 26 at 18:42 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 1 character in body
|
Jan 26 at 18:31 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 253 characters in body
|
Jan 25 at 19:06 | history | edited | Will Jagy | CC BY-SA 4.0 |
deleted 1 character in body
|
Jan 25 at 18:09 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 155 characters in body
|
Jan 25 at 7:53 | comment | added | Gordon Royle | The command "qfsign" from Pari/GP computes the signature of the quadratic form associated with the matrix - I have never dared to use it because I do not know if it uses exact arithmetic, and I have been bitten too many times by numerical instability. But your answer here suggests that it is possible to do this in rational arithmetic - do you know if Pari/GP actually does this? | |
Jan 24 at 21:26 | history | edited | Will Jagy | CC BY-SA 4.0 |
edited body
|
Jan 24 at 21:15 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 8 characters in body
|
Jan 24 at 20:26 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 288 characters in body
|
Jan 24 at 20:19 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 288 characters in body
|
Jan 24 at 20:09 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 110 characters in body
|
Jan 24 at 20:01 | history | edited | Will Jagy | CC BY-SA 4.0 |
added 2572 characters in body
|
Jan 24 at 19:56 | history | answered | Will Jagy | CC BY-SA 4.0 |