2021
DOI: 10.1080/17445760.2021.1945054
|View full text |Cite
|
Sign up to set email alerts
|

Realisation of the double sweep method by using a Sleptsov net

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Though a place of SN stores a nonnegative integer number, we can represent integer, rational, and floating numbers by a cortege of places, subnets for corresponding operations have been presented in [28]. As for the arrays and matrices, multidimensional as well, the most efficient implementation uses explicitly generated matrix computing structures, similar to shown in an example for solving Laplace equation in a single step for each iteration.…”
Section: An Overview Of Sleptsov Net Computing Paradigmmentioning
confidence: 99%
“…Though a place of SN stores a nonnegative integer number, we can represent integer, rational, and floating numbers by a cortege of places, subnets for corresponding operations have been presented in [28]. As for the arrays and matrices, multidimensional as well, the most efficient implementation uses explicitly generated matrix computing structures, similar to shown in an example for solving Laplace equation in a single step for each iteration.…”
Section: An Overview Of Sleptsov Net Computing Paradigmmentioning
confidence: 99%