Comparing exact expressions vs real numbersFixed-Point Numbers in MathematicaMatching pair of numbers {a,-a},...
PTIJ: Sport in the Torah
How would an energy-based "projectile" blow up a spaceship?
What is Tony Stark injecting into himself in Iron Man 3?
Giving a talk in my old university, how prominently should I tell students my salary?
Why do we call complex numbers “numbers” but we don’t consider 2-vectors numbers?
Precision notation for voltmeters
What is the best index strategy or query SELECT when performing a search/lookup BETWEEN IP address (IPv4 and IPv6) ranges?
Can multiple states demand income tax from an LLC?
Should I apply for my boss's promotion?
Averaging over columns while ignoring zero entries
The (Easy) Road to Code
Why aren't there more Gauls like Obelix?
Is this a crown race?
Can I negotiate a patent idea for a raise, under French law?
Help! My Character is too much for her story!
Why would /etc/passwd be used every time someone executes `ls -l` command?
I've given my players a lot of magic items. Is it reasonable for me to give them harder encounters?
Unidentified signals on FT8 frequencies
What is the orbit and expected lifetime of Crew Dragon trunk?
Why does a car's steering wheel get lighter with increasing speed
Rationale to prefer local variables over instance variables?
Why does this boat have a landing pad? (SpaceX's GO Searcher) Any plans for propulsive capsule landings?
Should I file my taxes? No income, unemployed, but paid 2k in student loan interest
Why do phishing e-mails use faked e-mail addresses instead of the real one?
Comparing exact expressions vs real numbers
Fixed-Point Numbers in MathematicaMatching pair of numbers {a,-a}, where a is numericSignificantly different results between Mathematica and Wolfram Alpha with large radicals and small numbersHow to solve this two algebraic equation simultaneously for u and H ?(all real number)Getting non-real answers when assuming variable is real when trying to numerically find maximum entropy distributionError and uncertainty propagation: Is using Precision/Accuracy a sound strategy?Partial Derivatives of numbers not evaluating?How to make Mathematica substitute exact numerical values of (derivatives) 2F1equal expressions give different numerical resultHow to solve equation in integer numbers
$begingroup$
Often I need to generate some data using some symmetry operations and I usually keep them as exact expressions (for example, consider the points on a triangular grid {{-(1/2), Sqrt[3]/2}, {-(1/2), -(Sqrt[3]/2)}, {1, 0}, ...}) and I need to compare different points, something like if a1+b==a2. I am trying to find an efficient way to do that.
Consider this
a=-2/Sqrt[3] + Sqrt[3]
b=Sqrt[1/4 + (2/Sqrt[3] - Sqrt[3]/2)^2]
{N[a],N[b]}
{0.57735,0.57735}
Now, a==b does not do anything.
N[a] == N[b]
N[a]-N[b] == 0
N[a - b] == 0
True
False
False
Because N[a-b]=-3.33067*10^-16. So the way out is
Chop@N[a - b] == 0
True
However,
RepeatedTiming[N[a] == N[b]]
RepeatedTiming[Chop@N[a - b] == 0]
{5.4*10^-6, True}
{9.07*10^-6, True}
On the other hand,
a1 = N[a]; b1 = N[b];
RepeatedTiming[a1 == b1]
{2.7*10^-7, True}
So my questions are
Is it better to use real numbers if I have to do such comparisons?
What would be the best (least time consuming when dealing with a large number of inputs) way to compare exact expressions if I have to use exact expressions?
numerical-value
$endgroup$
add a comment |
$begingroup$
Often I need to generate some data using some symmetry operations and I usually keep them as exact expressions (for example, consider the points on a triangular grid {{-(1/2), Sqrt[3]/2}, {-(1/2), -(Sqrt[3]/2)}, {1, 0}, ...}) and I need to compare different points, something like if a1+b==a2. I am trying to find an efficient way to do that.
Consider this
a=-2/Sqrt[3] + Sqrt[3]
b=Sqrt[1/4 + (2/Sqrt[3] - Sqrt[3]/2)^2]
{N[a],N[b]}
{0.57735,0.57735}
Now, a==b does not do anything.
N[a] == N[b]
N[a]-N[b] == 0
N[a - b] == 0
True
False
False
Because N[a-b]=-3.33067*10^-16. So the way out is
Chop@N[a - b] == 0
True
However,
RepeatedTiming[N[a] == N[b]]
RepeatedTiming[Chop@N[a - b] == 0]
{5.4*10^-6, True}
{9.07*10^-6, True}
On the other hand,
a1 = N[a]; b1 = N[b];
RepeatedTiming[a1 == b1]
{2.7*10^-7, True}
So my questions are
Is it better to use real numbers if I have to do such comparisons?
What would be the best (least time consuming when dealing with a large number of inputs) way to compare exact expressions if I have to use exact expressions?
numerical-value
$endgroup$
1
$begingroup$
You'll want to be careful if you find cases like this.N[Sin[2017 2^(1/5)]] - N[-1]
$endgroup$
– J. M. is computer-less♦
16 hours ago
1
$begingroup$
PossibleZeroQcould help.
$endgroup$
– Roman
16 hours ago
$begingroup$
@J.M.iscomputer-less Damn, this almost integer stuff is fascinating. Thanks!
$endgroup$
– Loki
10 hours ago
add a comment |
$begingroup$
Often I need to generate some data using some symmetry operations and I usually keep them as exact expressions (for example, consider the points on a triangular grid {{-(1/2), Sqrt[3]/2}, {-(1/2), -(Sqrt[3]/2)}, {1, 0}, ...}) and I need to compare different points, something like if a1+b==a2. I am trying to find an efficient way to do that.
Consider this
a=-2/Sqrt[3] + Sqrt[3]
b=Sqrt[1/4 + (2/Sqrt[3] - Sqrt[3]/2)^2]
{N[a],N[b]}
{0.57735,0.57735}
Now, a==b does not do anything.
N[a] == N[b]
N[a]-N[b] == 0
N[a - b] == 0
True
False
False
Because N[a-b]=-3.33067*10^-16. So the way out is
Chop@N[a - b] == 0
True
However,
RepeatedTiming[N[a] == N[b]]
RepeatedTiming[Chop@N[a - b] == 0]
{5.4*10^-6, True}
{9.07*10^-6, True}
On the other hand,
a1 = N[a]; b1 = N[b];
RepeatedTiming[a1 == b1]
{2.7*10^-7, True}
So my questions are
Is it better to use real numbers if I have to do such comparisons?
What would be the best (least time consuming when dealing with a large number of inputs) way to compare exact expressions if I have to use exact expressions?
numerical-value
$endgroup$
Often I need to generate some data using some symmetry operations and I usually keep them as exact expressions (for example, consider the points on a triangular grid {{-(1/2), Sqrt[3]/2}, {-(1/2), -(Sqrt[3]/2)}, {1, 0}, ...}) and I need to compare different points, something like if a1+b==a2. I am trying to find an efficient way to do that.
Consider this
a=-2/Sqrt[3] + Sqrt[3]
b=Sqrt[1/4 + (2/Sqrt[3] - Sqrt[3]/2)^2]
{N[a],N[b]}
{0.57735,0.57735}
Now, a==b does not do anything.
N[a] == N[b]
N[a]-N[b] == 0
N[a - b] == 0
True
False
False
Because N[a-b]=-3.33067*10^-16. So the way out is
Chop@N[a - b] == 0
True
However,
RepeatedTiming[N[a] == N[b]]
RepeatedTiming[Chop@N[a - b] == 0]
{5.4*10^-6, True}
{9.07*10^-6, True}
On the other hand,
a1 = N[a]; b1 = N[b];
RepeatedTiming[a1 == b1]
{2.7*10^-7, True}
So my questions are
Is it better to use real numbers if I have to do such comparisons?
What would be the best (least time consuming when dealing with a large number of inputs) way to compare exact expressions if I have to use exact expressions?
numerical-value
numerical-value
asked 16 hours ago
SumitSumit
11.7k21955
11.7k21955
1
$begingroup$
You'll want to be careful if you find cases like this.N[Sin[2017 2^(1/5)]] - N[-1]
$endgroup$
– J. M. is computer-less♦
16 hours ago
1
$begingroup$
PossibleZeroQcould help.
$endgroup$
– Roman
16 hours ago
$begingroup$
@J.M.iscomputer-less Damn, this almost integer stuff is fascinating. Thanks!
$endgroup$
– Loki
10 hours ago
add a comment |
1
$begingroup$
You'll want to be careful if you find cases like this.N[Sin[2017 2^(1/5)]] - N[-1]
$endgroup$
– J. M. is computer-less♦
16 hours ago
1
$begingroup$
PossibleZeroQcould help.
$endgroup$
– Roman
16 hours ago
$begingroup$
@J.M.iscomputer-less Damn, this almost integer stuff is fascinating. Thanks!
$endgroup$
– Loki
10 hours ago
1
1
$begingroup$
You'll want to be careful if you find cases like this.
N[Sin[2017 2^(1/5)]] - N[-1]$endgroup$
– J. M. is computer-less♦
16 hours ago
$begingroup$
You'll want to be careful if you find cases like this.
N[Sin[2017 2^(1/5)]] - N[-1]$endgroup$
– J. M. is computer-less♦
16 hours ago
1
1
$begingroup$
PossibleZeroQ could help.$endgroup$
– Roman
16 hours ago
$begingroup$
PossibleZeroQ could help.$endgroup$
– Roman
16 hours ago
$begingroup$
@J.M.iscomputer-less Damn, this almost integer stuff is fascinating. Thanks!
$endgroup$
– Loki
10 hours ago
$begingroup$
@J.M.iscomputer-less Damn, this almost integer stuff is fascinating. Thanks!
$endgroup$
– Loki
10 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
PossibleZeroQ is rather fast and does precisely what you're looking for:
RepeatedTiming[PossibleZeroQ[a - b]]
{3.2*10^-6, True}
@JM's difficult case is handled correctly:
PossibleZeroQ[Sin[2017 2^(1/5)] - (-1)]
False
The limits of PossibleZeroQ can be fine-tuned with $MaxExtraPrecision.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "387"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f192869%2fcomparing-exact-expressions-vs-real-numbers%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
PossibleZeroQ is rather fast and does precisely what you're looking for:
RepeatedTiming[PossibleZeroQ[a - b]]
{3.2*10^-6, True}
@JM's difficult case is handled correctly:
PossibleZeroQ[Sin[2017 2^(1/5)] - (-1)]
False
The limits of PossibleZeroQ can be fine-tuned with $MaxExtraPrecision.
$endgroup$
add a comment |
$begingroup$
PossibleZeroQ is rather fast and does precisely what you're looking for:
RepeatedTiming[PossibleZeroQ[a - b]]
{3.2*10^-6, True}
@JM's difficult case is handled correctly:
PossibleZeroQ[Sin[2017 2^(1/5)] - (-1)]
False
The limits of PossibleZeroQ can be fine-tuned with $MaxExtraPrecision.
$endgroup$
add a comment |
$begingroup$
PossibleZeroQ is rather fast and does precisely what you're looking for:
RepeatedTiming[PossibleZeroQ[a - b]]
{3.2*10^-6, True}
@JM's difficult case is handled correctly:
PossibleZeroQ[Sin[2017 2^(1/5)] - (-1)]
False
The limits of PossibleZeroQ can be fine-tuned with $MaxExtraPrecision.
$endgroup$
PossibleZeroQ is rather fast and does precisely what you're looking for:
RepeatedTiming[PossibleZeroQ[a - b]]
{3.2*10^-6, True}
@JM's difficult case is handled correctly:
PossibleZeroQ[Sin[2017 2^(1/5)] - (-1)]
False
The limits of PossibleZeroQ can be fine-tuned with $MaxExtraPrecision.
edited 20 mins ago
answered 13 hours ago
RomanRoman
2,735717
2,735717
add a comment |
add a comment |
Thanks for contributing an answer to Mathematica Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f192869%2fcomparing-exact-expressions-vs-real-numbers%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
You'll want to be careful if you find cases like this.
N[Sin[2017 2^(1/5)]] - N[-1]$endgroup$
– J. M. is computer-less♦
16 hours ago
1
$begingroup$
PossibleZeroQcould help.$endgroup$
– Roman
16 hours ago
$begingroup$
@J.M.iscomputer-less Damn, this almost integer stuff is fascinating. Thanks!
$endgroup$
– Loki
10 hours ago