×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Computational decomposition and composition technique for approximate solution of nonstationary problems

Click here to flash read.

arXiv:2403.18472v1 Announce Type: new
Abstract: Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional equations can be reduced by additive decomposition of the problem operator(s) and composition of the approximate solution using particular explicit-implicit time approximations. Such a technique is currently applied in conditions where the decomposition step is uncomplicated. A general approach is proposed to construct decomposition-composition algorithms for evolution equations in finite-dimensional Hilbert spaces. It is based on two main variants of the decomposition of the unit operator in the corresponding spaces at the decomposition stage and the application of additive operator-difference schemes at the composition stage. The general results are illustrated on the boundary value problem for a second-order parabolic equation by constructing standard splitting schemes on spatial variables and region-additive schemes (domain decomposition schemes).

Click here to read this post out
ID: 806940; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: March 28, 2024, 7:32 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 11
CC:
No creative common's license
Comments: