Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

impl. of sqrtf_neon_hpf() #7

Open
GoogleCodeExporter opened this issue Feb 23, 2016 · 0 comments
Open

impl. of sqrtf_neon_hpf() #7

GoogleCodeExporter opened this issue Feb 23, 2016 · 0 comments

Comments

@GoogleCodeExporter
Copy link


sqrtf_neon_hpf() first computes the inverse of the square root, and then the 
reciprocal, i.e.

t = 1/sqrt(x)
r = 1/t

it might be easier/faster to compute the inverse of the square root, and then 
multiply by the original value, i.e.

t = 1/sqrt(x)
r = x * t

Original issue reported on code.google.com by [email protected] on 15 Sep 2011 at 11:53

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

No branches or pull requests

1 participant