Sentence examples for rewriting the problem from inspiring English sources

This is achieved by rewriting the problem into an integrability problem using state-space realization theory.

Parallel programming faces two major challenges: how to efficiently map computations to different parallel hardware architectures, and how to do it in a modular way, i.e., without rewriting the problem solving code.

We rewrite the problem (1.1 - 1.3 1.1 - 1.3ws.

Now, rewrite the problem in the differential operator form: (3.27).

For the second solution it was necessary to rewrite the problem again and use (3.9).

For the sake of simplicity, we rewrite the problem (3.9) as follows: find such that (3.14).

To compute its numerical approximation, we rewrite the problem (1.9a - 1.9b 1.9a - 1.9ber (3.8).

To this, we first rewrite the problem (1.1) to the following equivalent form (1.2). where.

Then we can rewrite the problem (2.3 - 2.4 2.3 - 2.4eas stheement mathcal{A}(u,v)=numathcal{B}(u,v).

Now we can rewrite the problem (1 - 7) in the operator form as (AU = lambda U) where (U = binom{ u ( x ) }{ R' ( u ) }in D ( A )).

As in [34], we rewrite the problem into a semidefinite program and make a relaxation by dropping the rank-one constraint.