hiro/arb
1
0
Fork 0
mirror of https://github.com/vale981/arb synced 2025-03-05 09:21:38 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

MAINT: fro -> frobenius

Browse source
This commit is contained in:
alex 2016-04-06 11:32:51 -04:00
parent ef00303e2e
commit eb9573c61c
8 changed files with 18 additions and 18 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
acb_mat.h
View file

@ -150,7 +150,7 @@ void acb_mat_transpose(acb_mat_t mat1, const acb_mat_t mat2);
void acb_mat_bound_inf_norm(mag_t b, const acb_mat_t A);
void acb_mat_bound_fro_norm(mag_t b, const acb_mat_t A);
void acb_mat_bound_frobenius_norm(mag_t b, const acb_mat_t A);
/* Arithmetic */

2
acb_mat/bound_fro_norm.c → acb_mat/bound_frobenius_norm.c
View file

@ -26,7 +26,7 @@
#include "acb_mat.h"
void
acb_mat_bound_fro_norm(mag_t b, const acb_mat_t A)
acb_mat_bound_frobenius_norm(mag_t b, const acb_mat_t A)
{
slong i, j, r, c;
mag_t t;

12
acb_mat/test/t-trace.c
View file

@ -151,7 +151,7 @@ int main()
slong m, n, prec;
acb_mat_t A, AH, AHA;
acb_t t;
mag_t low, fro;
mag_t low, frobenius;
prec = 2 + n_randint(state, 200);
@ -174,10 +174,10 @@ int main()
mag_init(low);
acb_get_mag_lower(low, t);
mag_init(fro);
acb_mat_bound_fro_norm(fro, A);
mag_init(frobenius);
acb_mat_bound_frobenius_norm(frobenius, A);
if (mag_cmp(low, fro) > 0)
if (mag_cmp(low, frobenius) > 0)
{
flint_printf("FAIL (frobenius norm)\n", iter);
flint_printf("m = %wd, n = %wd, prec = %wd\n", m, n, prec);
@ -189,7 +189,7 @@ int main()
mag_printd(low, 15); flint_printf("\n\n");
flint_printf("upper(frobenius_norm(A)) = \n");
mag_printd(fro, 15); flint_printf("\n\n");
mag_printd(frobenius, 15); flint_printf("\n\n");
abort();
}
@ -197,7 +197,7 @@ int main()
acb_clear(t);
mag_clear(low);
mag_clear(fro);
mag_clear(frobenius);
acb_mat_clear(A);
acb_mat_clear(AH);

2
arb_mat.h
View file

@ -142,7 +142,7 @@ void arb_mat_transpose(arb_mat_t mat1, const arb_mat_t mat2);
void arb_mat_bound_inf_norm(mag_t b, const arb_mat_t A);
void arb_mat_bound_fro_norm(mag_t b, const arb_mat_t A);
void arb_mat_bound_frobenius_norm(mag_t b, const arb_mat_t A);
/* Arithmetic */

2
arb_mat/bound_fro_norm.c → arb_mat/bound_frobenius_norm.c
View file

@ -26,7 +26,7 @@
#include "arb_mat.h"
void
arb_mat_bound_fro_norm(mag_t b, const arb_mat_t A)
arb_mat_bound_frobenius_norm(mag_t b, const arb_mat_t A)
{
slong i, j, r, c;
mag_t t;

12
arb_mat/test/t-trace.c
View file

@ -142,7 +142,7 @@ int main()
slong m, n, prec;
arb_mat_t A, AT, ATA;
arb_t t;
mag_t low, fro;
mag_t low, frobenius;
prec = 2 + n_randint(state, 200);
@ -165,10 +165,10 @@ int main()
mag_init(low);
arb_get_mag_lower(low, t);
mag_init(fro);
arb_mat_bound_fro_norm(fro, A);
mag_init(frobenius);
arb_mat_bound_frobenius_norm(frobenius, A);
if (mag_cmp(low, fro) > 0)
if (mag_cmp(low, frobenius) > 0)
{
flint_printf("FAIL (frobenius norm)\n", iter);
flint_printf("m = %wd, n = %wd, prec = %wd\n", m, n, prec);
@ -180,7 +180,7 @@ int main()
mag_printd(low, 15); flint_printf("\n\n");
flint_printf("upper(frobenius_norm(A)) = \n");
mag_printd(fro, 15); flint_printf("\n\n");
mag_printd(frobenius, 15); flint_printf("\n\n");
abort();
}
@ -188,7 +188,7 @@ int main()
arb_clear(t);
mag_clear(low);
mag_clear(fro);
mag_clear(frobenius);
arb_mat_clear(A);
arb_mat_clear(AT);

2
doc/source/acb_mat.rst
View file

@ -161,7 +161,7 @@ Norms
Sets *b* to an upper bound for the infinity norm (i.e. the largest
absolute value row sum) of *A*.
.. function:: void acb_mat_bound_fro_norm(mag_t b, const acb_mat_t A)
.. function:: void acb_mat_bound_frobenius_norm(mag_t b, const acb_mat_t A)
Sets *b* to an upper bound for the Frobenius norm (i.e. the square root
of the sum of squares of magnitudes of entries) of *A*.

2
doc/source/arb_mat.rst
View file

@ -152,7 +152,7 @@ Norms
Sets *b* to an upper bound for the infinity norm (i.e. the largest
absolute value row sum) of *A*.
.. function:: void arb_mat_bound_fro_norm(mag_t b, const arb_mat_t A)
.. function:: void arb_mat_bound_frobenius_norm(mag_t b, const arb_mat_t A)
Sets *b* to an upper bound for the Frobenius norm (i.e. the square root
of the sum of squares of entries) of *A*.