Knowledge

Category:Root-finding algorithms

Source 📝

115: 74: 315: 256: 152: 250: 139: 233: 94: 339: 187: 209: 127: 35: 18: 192: 8: 344: 334: 228: 291: 274: 262: 204: 297: 222: 50: 303: 163: 158: 78: 98: 328: 286: 46: 238: 23: 62:
This category has the following 2 subcategories, out of 2 total.
175: 114:
The following 23 pages are in this category, out of 23 total.
326: 111:Pages in category "Root-finding algorithms" 49:. Root-finding algorithms are studied in 116:This list may not reflect recent changes 327: 316:Sidi's generalized secant method 57: 257:Methods of successive approximation 153:Bailey's method (root finding) 75:Polynomial factorization algorithms 13: 120: 64: 56: 14: 356: 251:Methods of computing square roots 140:Alpha max plus beta min algorithm 234:Inverse quadratic interpolation 1: 109: 7: 10: 361: 210:Householder's method 22:is a numerical method or 188:Fast inverse square root 128:Root-finding algorithm 19:root-finding algorithm 193:Fixed-point iteration 292:Ridders' method 275:Newton's method 263:Muller's method 205:Halley's method 95:Quasi-Newton methods 26:for finding a value 304:Ruffini's rule 229:Integer square root 164:Brent's method 340:Numerical analysis 298:Root of a function 223:Illinois algorithm 51:numerical analysis 352: 300: 259: 225: 159:Bisection method 155: 100: 80: 360: 359: 355: 354: 353: 351: 350: 349: 325: 324: 323: 322: 321: 320: 308: 296: 279: 267: 255: 243: 221: 214: 197: 180: 168: 151: 144: 132: 108: 107: 106: 105: 102: 101: 85: 82: 81: 55: 12: 11: 5: 358: 348: 347: 342: 337: 319: 318: 312: 309: 307: 306: 301: 294: 289: 283: 280: 278: 277: 271: 268: 266: 265: 260: 253: 247: 244: 242: 241: 236: 231: 226: 218: 215: 213: 212: 207: 201: 198: 196: 195: 190: 184: 181: 179: 178: 172: 169: 167: 166: 161: 156: 148: 145: 143: 142: 136: 133: 131: 130: 124: 122: 121: 112: 104: 103: 93: 92: 89: 86: 84: 83: 73: 72: 69: 66: 65: 60: 34:, for a given 9: 6: 4: 3: 2: 357: 346: 343: 341: 338: 336: 333: 332: 330: 317: 314: 313: 310: 305: 302: 299: 295: 293: 290: 288: 285: 284: 281: 276: 273: 272: 269: 264: 261: 258: 254: 252: 249: 248: 245: 240: 237: 235: 232: 230: 227: 224: 220: 219: 216: 211: 208: 206: 203: 202: 199: 194: 191: 189: 186: 185: 182: 177: 174: 173: 170: 165: 162: 160: 157: 154: 150: 149: 146: 141: 138: 137: 134: 129: 126: 125: 123: 119: 117: 110: 96: 91: 90: 87: 76: 71: 70: 67: 63: 59:Subcategories 58: 54: 52: 48: 44: 40: 37: 33: 29: 25: 21: 20: 287:Regula falsi 113: 61: 45:is a single 42: 38: 31: 27: 17: 15: 47:real number 345:0 (number) 335:Algorithms 329:Categories 239:ITP method 30:such that 24:algorithm 41:. Here, 36:function 32:f(x) = 0 176:CORDIC 79:(19 P) 99:(7 P) 331:: 118:. 97:‎ 77:‎ 53:. 16:A 311:S 282:R 270:N 246:M 217:I 200:H 183:F 171:C 147:B 135:A 88:Q 68:P 43:x 39:f 28:x

Index

root-finding algorithm
algorithm
function
real number
numerical analysis
Polynomial factorization algorithms
Quasi-Newton methods
This list may not reflect recent changes
Root-finding algorithm
Alpha max plus beta min algorithm
Bailey's method (root finding)
Bisection method
Brent's method
CORDIC
Fast inverse square root
Fixed-point iteration
Halley's method
Householder's method
Illinois algorithm
Integer square root
Inverse quadratic interpolation
ITP method
Methods of computing square roots
Methods of successive approximation
Muller's method
Newton's method
Regula falsi
Ridders' method
Root of a function
Ruffini's rule

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.