The following pages link to Mansor Monsi (Q410400):
Displaying 26 items.
- A low memory solver for integral equations of Chandrasekhar type in the radiative transfer problems (Q410401) (← links)
- (Q1098561) (redirect page) (← links)
- An algorithm for the simultaneous inclusion of real polynomial zeros (Q1098562) (← links)
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros (Q1112563) (← links)
- ON THE CONVERGENCE OF IRTSS1 FOR SIMULTANEOUS INCLUSION OF POLYNOMIAL ZEROS (Q2796318) (← links)
- ON CONVERGENCE OF INAAH2 PROCEDURE FOR BOUNDING POLYNOMIAL ZEROS SIMULTANEOUSLY (Q2796319) (← links)
- ON CONVERGENCE OF INAAH1 FOR BOUNDING OF POLYNOMIAL ZEROS SIMULTANEOUSLY (Q2796429) (← links)
- THE REPEATED PROCEDURE PMSS1 FOR ESTIMATING POLYNOMIAL ZEROS (Q2796452) (← links)
- INTERVAL TOTAL SINGLE STEP PROCEDURE FOR BOUNDING POLYNOMIAL ZEROS (Q2811364) (← links)
- ON THE CONVERGENCE OF INTERVAL TOTAL SINGLE STEP PROCEDURE FOR POLYNOMIAL ZEROS (Q2811371) (← links)
- (Q2898628) (← links)
- (Q2898633) (← links)
- (Q2904369) (← links)
- (Q2906041) (← links)
- (Q2907855) (← links)
- (Q2978443) (← links)
- A New Newton's Method with Diagonal Jacobian Approximation for Systems of Nonlinear Equations (Q3064808) (← links)
- (Q3080912) (← links)
- (Q3224811) (← links)
- (Q3451951) (← links)
- THE MIDPOINT ZORO SYMMETRIC SINGLE-STEP PROCEDURE FOR POLYNOMIAL ZEROS (Q3465006) (← links)
- THE NEWTON’S METHOD INTERVAL SINGLE-STEP PROCEDURE FOR BOUNDING POLYNOMIAL ZEROS SIMULTANEOUSLY (Q3465007) (← links)
- Application of simulated annealing to solve multi-objectives for aggregate production planning (Q4989310) (← links)
- An efficient interval symmetric single step procedure ISS1-5D for simultaneous bounding of real polynomial zeros (Q5400440) (← links)
- On modified interval symmetric single-step procedure ISS2-5D for the simultaneous inclusion of polynomial zeros (Q5400442) (← links)
- (Q5747993) (← links)
