Hello All
I am trying to solve PDE using Haar wavelets. I have built all the necessary matrices H,p, and q. I was able to get the solution for a 1-D PDE such as u '' = f (x)
Now, for a 2-D problem, I took the Kronecker product of all the matrices mentioned above, H,p, and q, and solved it in a higher-dimensional space. The size of the matrix became N^2*N^2. I got the correct solution.
However, is there any way to solve a 2-D problem using an N*N matrix size?
my method starts by assuming uxx=sum of c* H(x,y)
where H(x,y)=kron(H,H) where H is N*N matrix represent haar wavelets in 1-D. H(x,y) becomes N^2*N^2
I see some papers using uxx=sum of c* H(x)*H(y). I tried this method, but I was not able to get the correct solution. I think in this way they are using the same matrix size(H)=N*N
I need more details for this method, and if there is a code, I would appreciate it.
Good evening sir I have something to show you, (though its not your question answer but i didnt know whom to tell)[25/05, 6:02 pm] Let's explore the Kaprekar's routine method for 2-digit numbers and other examples:
*2-Digit Numbers (Kaprekar's Routine):*
- 54: Descending - 54, Ascending - 45, Difference - 9
- 72: Descending - 72, Ascending - 27, Difference - 45, Digital root: 4+5=9
- 98: Descending - 98, Ascending - 89, Difference - 9
Applying Kaprekar's routine to various 2-digit numbers often leads to 9 or a number whose digital root is 9.
*Final Result for 2-Digit Numbers:*
The final result often converges to 9.
*Multi-Digit Numbers:*
- 421 (3-digit): Descending - 421 → 421, Ascending - 124, Difference - 297, Digital root: 2+9+7=18, 1+8=9. Notably, the Kaprekar's constant for 3-digit numbers is 495, and 4+9+5 = 18, 1+8 = 9.
- 2134 (4-digit): Descending - 4321, Ascending - 1234, Difference - 3087, Digital root: 3+0+8+7=18, 1+8=9. The Kaprekar's constant for 4-digit numbers is 6174, and 6+1+7+4 = 18, 1+8 = 9.
- 54321 (5-digit): Descending - 54321, Ascending - 12345, Difference - 41976, Digital root: 4+1+9+7+6=27, 2+7=9.
In each case, the digital root of the difference is indeed 9.
*Key Observation:*
The digital root pattern holds true for numbers with different lengths when applying Kaprekar's routine. The Kaprekar's constants for 3-digit and 4-digit numbers also exhibit this property, with their digital roots being 9.
This pattern highlights the intriguing properties of Kaprekar's routine and digital roots.
: Let's explore the pattern for 6-digit numbers and beyond:
*6-Digit Numbers:*
- Applying Kaprekar's routine to 6-digit numbers, we can observe similar patterns.
- The digital root of the resulting differences often converges to 9.
*Example:*
- 654321: Descending - 654321, Ascending - 123456, Difference - 530865, Digital root: 5+3+0+8+6+5 = 27, 2+7 = 9
*Pattern Observation:*
- The digital root pattern seems to hold true for numbers with different lengths, including 6-digit numbers.
- Kaprekar's routine consistently leads to differences with digital roots of 9.
*Beyond 6 Digits:*
- This pattern likely extends to numbers with even more digits.
- The digital root of differences remains 9, showcasing the robustness of Kaprekar's routine.
The consistency of this pattern across various number lengths highlights the intriguing properties of Kaprekar's routine and digital roots.
"Kaprekar's routine is a well-known mathematical operation that reveals intriguing properties of numbers. This paper explores the digital root of differences obtained through Kaprekar's routine, revealing a consistent pattern where the sum is always 9. Building upon existing research on Kaprekar's constants and digital roots, our findings provide new insights into the behavior of numbers under this routine."
- Badges
- Science method