Skip to content

Conversation

@cruisesong7
Copy link
Collaborator

Refactored repetitive proofs by using Ltac and goal selectors in jacob_list_fun_model, inf_norm_properties, and mostly in fma_jacobi_foward_error.

try apply fprec_lt_femax.
Qed.

Ltac FT2R_v_max_bound v n i H0 :=
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

try to make this a lemma

(bpow Zaux.radix2 (femax t) -
default_abs t) / (1 + default_rel t))%Re.

Ltac assert_rewrite_pow_apply k rho_ge_0 H0 :=
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

make it as lemma

split; [apply rho_ge_0 | apply Rlt_le, H0].


Ltac apply_double_Rmult_le_compat_r_sequence d_mag_ge_0 Rinv_0_lt_compat Rlt_Rminus rho_ge_0 H0 :=
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

make it as lemma

@size_constraint ty n /\
input_bound A x0 b.

Ltac specialize_and_rewrite Hfin n i :=
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

make a lemma

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants