HP Prime complex division problem in CAS
|
11-20-2020, 05:00 PM
Post: #8
|
|||
|
|||
RE: HP Prime complex division problem in CAS
As for maxnorm on complex numbers, this is intended. For exact data computing a square root (L2 norm) is costly (or even impossible if the integer is too large to be factored), while |z| defined as|x|+|y| is also a norm (L1 norm) and much faster to compute (O(1)).
Linf norm could works as well. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)