The phrase "a discrete solution" is correct and usable in written English.
It can be used in contexts such as mathematics, computer science, or problem-solving where a distinct or separate solution is being referred to.
Example: "In this optimization problem, we need to find a discrete solution that meets all the constraints."
Alternatives: "an individual solution" or "a distinct solution".
Numerical computation was carried out to obtain a discrete solution of the minimum rolling thickness.
In theory, RE can be used also on PDE approximations when the convergence order of a discrete solution is clearly known.
Second, a transition system abstracting the motion capabilities of the whole team is constructed, and a discrete solution to the problem is found by using an approach similar to model checking.
The resulting seven coupled partial differential equations are solved by a finite difference method on a single grid and a discrete solution is obtained by combining a steady-state and a time-dependent Newton's method.
The characteristic equation of the free vibration is derived by applying the Green function which is obtained as a discrete solution of differential equations governing the flexural behaviour of the sandwich beam under the action of a concentrated load.
A discrete solution is given explicitly for the inviscid Bürgers equation and the oscillatory nature of the shock profiles is determined according to the scheme order and to the shock location with respect to the mesh.
Remark 5.9 Comparing the continuous scenario and the discrete scenario, we see that a continuous solution of (60) and a corresponding discrete solution of (91) may lead to the same momenta.
In Section 4, we associate with the discrete introduced problem a fixed point mapping, which we use in proving the existence of a unique discrete solution.
Arguing as in the continuous case, the minimization problem (10.14) J (U (T ) ) = min V ∈ S 0 1 (T ) J (V ) admits a unique discrete solution U (T ) ∈ S 0 1 (T ), which satisfies (10.15) 〈 L U (T ), V 〉 = ∫ Ω f V d x for all V ∈ S 0 1 (T ).
A key component of our method is a formulation of the discrete submodular minimization problem as a continuous best approximation problem that is solved through a sequence of reflections, and its solution can be easily thresholded to obtain an optimal discrete solution.
The approach incorporates a two-dimensional, discrete solution utilizing a wavenumber-based gridding technique to compute frequency-dependent local mass, damping, and stiffness matrices which can be assembled into the global structural operators.
